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"
26 #include "dynamic-string.h"
27 #include "fail-open.h"
28 #include "guarded-list.h"
33 #include "ofproto-dpif-ipfix.h"
34 #include "ofproto-dpif-sflow.h"
35 #include "ofproto-dpif-xlate.h"
38 #include "poll-loop.h"
41 #include "openvswitch/vlog.h"
43 #define MAX_QUEUE_LENGTH 512
44 #define UPCALL_MAX_BATCH 64
45 #define REVALIDATE_MAX_BATCH 50
47 VLOG_DEFINE_THIS_MODULE(ofproto_dpif_upcall);
49 COVERAGE_DEFINE(dumped_duplicate_flow);
50 COVERAGE_DEFINE(dumped_new_flow);
51 COVERAGE_DEFINE(handler_duplicate_upcall);
52 COVERAGE_DEFINE(upcall_ukey_contention);
53 COVERAGE_DEFINE(revalidate_missed_dp_flow);
55 /* A thread that reads upcalls from dpif, forwards each upcall's packet,
56 * and possibly sets up a kernel flow as a cache. */
58 struct udpif *udpif; /* Parent udpif. */
59 pthread_t thread; /* Thread ID. */
60 uint32_t handler_id; /* Handler id. */
63 /* In the absence of a multiple-writer multiple-reader datastructure for
64 * storing ukeys, we use a large number of cmaps, each with its own lock for
66 #define N_UMAPS 512 /* per udpif. */
68 struct ovs_mutex mutex; /* Take for writing to the following. */
69 struct cmap cmap; /* Datapath flow keys. */
72 /* A thread that processes datapath flows, updates OpenFlow statistics, and
73 * updates or removes them if necessary. */
75 struct udpif *udpif; /* Parent udpif. */
76 pthread_t thread; /* Thread ID. */
77 unsigned int id; /* ovsthread_id_self(). */
80 /* An upcall handler for ofproto_dpif.
82 * udpif keeps records of two kind of logically separate units:
87 * - An array of 'struct handler's for upcall handling and flow
93 * - Revalidation threads which read the datapath flow table and maintains
97 struct ovs_list list_node; /* In all_udpifs list. */
99 struct dpif *dpif; /* Datapath handle. */
100 struct dpif_backer *backer; /* Opaque dpif_backer pointer. */
102 struct handler *handlers; /* Upcall handlers. */
105 struct revalidator *revalidators; /* Flow revalidators. */
106 size_t n_revalidators;
108 struct latch exit_latch; /* Tells child threads to exit. */
111 struct seq *reval_seq; /* Incremented to force revalidation. */
112 bool reval_exit; /* Set by leader on 'exit_latch. */
113 struct ovs_barrier reval_barrier; /* Barrier used by revalidators. */
114 struct dpif_flow_dump *dump; /* DPIF flow dump state. */
115 long long int dump_duration; /* Duration of the last flow dump. */
116 struct seq *dump_seq; /* Increments each dump iteration. */
117 atomic_bool enable_ufid; /* If true, skip dumping flow attrs. */
119 /* There are 'N_UMAPS' maps containing 'struct udpif_key' elements.
121 * During the flow dump phase, revalidators insert into these with a random
122 * distribution. During the garbage collection phase, each revalidator
123 * takes care of garbage collecting a slice of these maps. */
126 /* Datapath flow statistics. */
127 unsigned int max_n_flows;
128 unsigned int avg_n_flows;
130 /* Following fields are accessed and modified by different threads. */
131 atomic_uint flow_limit; /* Datapath flow hard limit. */
133 /* n_flows_mutex prevents multiple threads updating these concurrently. */
134 atomic_uint n_flows; /* Number of flows in the datapath. */
135 atomic_llong n_flows_timestamp; /* Last time n_flows was updated. */
136 struct ovs_mutex n_flows_mutex;
138 /* Following fields are accessed and modified only from the main thread. */
139 struct unixctl_conn **conns; /* Connections waiting on dump_seq. */
140 uint64_t conn_seq; /* Corresponds to 'dump_seq' when
141 conns[n_conns-1] was stored. */
142 size_t n_conns; /* Number of connections waiting. */
146 BAD_UPCALL, /* Some kind of bug somewhere. */
147 MISS_UPCALL, /* A flow miss. */
148 SFLOW_UPCALL, /* sFlow sample. */
149 FLOW_SAMPLE_UPCALL, /* Per-flow sampling. */
150 IPFIX_UPCALL /* Per-bridge sampling. */
154 struct ofproto_dpif *ofproto; /* Parent ofproto. */
156 /* The flow and packet are only required to be constant when using
157 * dpif-netdev. If a modification is absolutely necessary, a const cast
158 * may be used with other datapaths. */
159 const struct flow *flow; /* Parsed representation of the packet. */
160 const ovs_u128 *ufid; /* Unique identifier for 'flow'. */
161 const struct ofpbuf *packet; /* Packet associated with this upcall. */
162 ofp_port_t in_port; /* OpenFlow in port, or OFPP_NONE. */
164 enum dpif_upcall_type type; /* Datapath type of the upcall. */
165 const struct nlattr *userdata; /* Userdata for DPIF_UC_ACTION Upcalls. */
167 bool xout_initialized; /* True if 'xout' must be uninitialized. */
168 struct xlate_out xout; /* Result of xlate_actions(). */
169 struct ofpbuf put_actions; /* Actions 'put' in the fastapath. */
171 struct dpif_ipfix *ipfix; /* IPFIX pointer or NULL. */
172 struct dpif_sflow *sflow; /* SFlow pointer or NULL. */
174 bool vsp_adjusted; /* 'packet' and 'flow' were adjusted for
175 VLAN splinters if true. */
177 struct udpif_key *ukey; /* Revalidator flow cache. */
178 bool ukey_persists; /* Set true to keep 'ukey' beyond the
179 lifetime of this upcall. */
181 uint64_t dump_seq; /* udpif->dump_seq at translation time. */
182 uint64_t reval_seq; /* udpif->reval_seq at translation time. */
184 /* Not used by the upcall callback interface. */
185 const struct nlattr *key; /* Datapath flow key. */
186 size_t key_len; /* Datapath flow key length. */
187 const struct nlattr *out_tun_key; /* Datapath output tunnel key. */
190 /* 'udpif_key's are responsible for tracking the little bit of state udpif
191 * needs to do flow expiration which can't be pulled directly from the
192 * datapath. They may be created by any handler or revalidator thread at any
193 * time, and read by any revalidator during the dump phase. They are however
194 * each owned by a single revalidator which takes care of destroying them
195 * during the garbage-collection phase.
197 * The mutex within the ukey protects some members of the ukey. The ukey
198 * itself is protected by RCU and is held within a umap in the parent udpif.
199 * Adding or removing a ukey from a umap is only safe when holding the
200 * corresponding umap lock. */
202 struct cmap_node cmap_node; /* In parent revalidator 'ukeys' map. */
204 /* These elements are read only once created, and therefore aren't
205 * protected by a mutex. */
206 const struct nlattr *key; /* Datapath flow key. */
207 size_t key_len; /* Length of 'key'. */
208 const struct nlattr *mask; /* Datapath flow mask. */
209 size_t mask_len; /* Length of 'mask'. */
210 struct ofpbuf *actions; /* Datapath flow actions as nlattrs. */
211 ovs_u128 ufid; /* Unique flow identifier. */
212 bool ufid_present; /* True if 'ufid' is in datapath. */
213 uint32_t hash; /* Pre-computed hash for 'key'. */
215 struct ovs_mutex mutex; /* Guards the following. */
216 struct dpif_flow_stats stats OVS_GUARDED; /* Last known stats.*/
217 long long int created OVS_GUARDED; /* Estimate of creation time. */
218 uint64_t dump_seq OVS_GUARDED; /* Tracks udpif->dump_seq. */
219 uint64_t reval_seq OVS_GUARDED; /* Tracks udpif->reval_seq. */
220 bool flow_exists OVS_GUARDED; /* Ensures flows are only deleted
223 struct xlate_cache *xcache OVS_GUARDED; /* Cache for xlate entries that
224 * are affected by this ukey.
225 * Used for stats and learning.*/
227 struct odputil_keybuf buf;
232 /* Datapath operation with optional ukey attached. */
234 struct udpif_key *ukey;
235 struct dpif_flow_stats stats; /* Stats for 'op'. */
236 struct dpif_op dop; /* Flow operation. */
239 static struct vlog_rate_limit rl = VLOG_RATE_LIMIT_INIT(1, 5);
240 static struct ovs_list all_udpifs = OVS_LIST_INITIALIZER(&all_udpifs);
242 static size_t recv_upcalls(struct handler *);
243 static int process_upcall(struct udpif *, struct upcall *,
244 struct ofpbuf *odp_actions);
245 static void handle_upcalls(struct udpif *, struct upcall *, size_t n_upcalls);
246 static void udpif_stop_threads(struct udpif *);
247 static void udpif_start_threads(struct udpif *, size_t n_handlers,
248 size_t n_revalidators);
249 static void *udpif_upcall_handler(void *);
250 static void *udpif_revalidator(void *);
251 static unsigned long udpif_get_n_flows(struct udpif *);
252 static void revalidate(struct revalidator *);
253 static void revalidator_sweep(struct revalidator *);
254 static void revalidator_purge(struct revalidator *);
255 static void upcall_unixctl_show(struct unixctl_conn *conn, int argc,
256 const char *argv[], void *aux);
257 static void upcall_unixctl_disable_megaflows(struct unixctl_conn *, int argc,
258 const char *argv[], void *aux);
259 static void upcall_unixctl_enable_megaflows(struct unixctl_conn *, int argc,
260 const char *argv[], void *aux);
261 static void upcall_unixctl_disable_ufid(struct unixctl_conn *, int argc,
262 const char *argv[], void *aux);
263 static void upcall_unixctl_enable_ufid(struct unixctl_conn *, int argc,
264 const char *argv[], void *aux);
265 static void upcall_unixctl_set_flow_limit(struct unixctl_conn *conn, int argc,
266 const char *argv[], void *aux);
267 static void upcall_unixctl_dump_wait(struct unixctl_conn *conn, int argc,
268 const char *argv[], void *aux);
269 static void upcall_unixctl_purge(struct unixctl_conn *conn, int argc,
270 const char *argv[], void *aux);
272 static struct udpif_key *ukey_create_from_upcall(const struct upcall *);
273 static int ukey_create_from_dpif_flow(const struct udpif *,
274 const struct dpif_flow *,
275 struct udpif_key **);
276 static bool ukey_install_start(struct udpif *, struct udpif_key *ukey);
277 static bool ukey_install_finish(struct udpif_key *ukey, int error);
278 static bool ukey_install(struct udpif *udpif, struct udpif_key *ukey);
279 static struct udpif_key *ukey_lookup(struct udpif *udpif,
280 const ovs_u128 *ufid);
281 static int ukey_acquire(struct udpif *, const struct dpif_flow *,
282 struct udpif_key **result, int *error);
283 static void ukey_delete__(struct udpif_key *);
284 static void ukey_delete(struct umap *, struct udpif_key *);
285 static enum upcall_type classify_upcall(enum dpif_upcall_type type,
286 const struct nlattr *userdata);
288 static int upcall_receive(struct upcall *, const struct dpif_backer *,
289 const struct ofpbuf *packet, enum dpif_upcall_type,
290 const struct nlattr *userdata, const struct flow *,
291 const ovs_u128 *ufid);
292 static void upcall_uninit(struct upcall *);
294 static upcall_callback upcall_cb;
296 static atomic_bool enable_megaflows = ATOMIC_VAR_INIT(true);
299 udpif_create(struct dpif_backer *backer, struct dpif *dpif)
301 static struct ovsthread_once once = OVSTHREAD_ONCE_INITIALIZER;
302 struct udpif *udpif = xzalloc(sizeof *udpif);
304 if (ovsthread_once_start(&once)) {
305 unixctl_command_register("upcall/show", "", 0, 0, upcall_unixctl_show,
307 unixctl_command_register("upcall/disable-megaflows", "", 0, 0,
308 upcall_unixctl_disable_megaflows, NULL);
309 unixctl_command_register("upcall/enable-megaflows", "", 0, 0,
310 upcall_unixctl_enable_megaflows, NULL);
311 unixctl_command_register("upcall/disable-ufid", "", 0, 0,
312 upcall_unixctl_disable_ufid, NULL);
313 unixctl_command_register("upcall/enable-ufid", "", 0, 0,
314 upcall_unixctl_enable_ufid, NULL);
315 unixctl_command_register("upcall/set-flow-limit", "", 1, 1,
316 upcall_unixctl_set_flow_limit, NULL);
317 unixctl_command_register("revalidator/wait", "", 0, 0,
318 upcall_unixctl_dump_wait, NULL);
319 unixctl_command_register("revalidator/purge", "", 0, 0,
320 upcall_unixctl_purge, NULL);
321 ovsthread_once_done(&once);
325 udpif->backer = backer;
326 atomic_init(&udpif->flow_limit, MIN(ofproto_flow_limit, 10000));
327 udpif->reval_seq = seq_create();
328 udpif->dump_seq = seq_create();
329 latch_init(&udpif->exit_latch);
330 list_push_back(&all_udpifs, &udpif->list_node);
331 atomic_init(&udpif->enable_ufid, false);
332 atomic_init(&udpif->n_flows, 0);
333 atomic_init(&udpif->n_flows_timestamp, LLONG_MIN);
334 ovs_mutex_init(&udpif->n_flows_mutex);
335 udpif->ukeys = xmalloc(N_UMAPS * sizeof *udpif->ukeys);
336 for (int i = 0; i < N_UMAPS; i++) {
337 cmap_init(&udpif->ukeys[i].cmap);
338 ovs_mutex_init(&udpif->ukeys[i].mutex);
341 dpif_register_upcall_cb(dpif, upcall_cb, udpif);
347 udpif_run(struct udpif *udpif)
349 if (udpif->conns && udpif->conn_seq != seq_read(udpif->dump_seq)) {
352 for (i = 0; i < udpif->n_conns; i++) {
353 unixctl_command_reply(udpif->conns[i], NULL);
362 udpif_destroy(struct udpif *udpif)
364 udpif_stop_threads(udpif);
366 for (int i = 0; i < N_UMAPS; i++) {
367 cmap_destroy(&udpif->ukeys[i].cmap);
368 ovs_mutex_destroy(&udpif->ukeys[i].mutex);
373 list_remove(&udpif->list_node);
374 latch_destroy(&udpif->exit_latch);
375 seq_destroy(udpif->reval_seq);
376 seq_destroy(udpif->dump_seq);
377 ovs_mutex_destroy(&udpif->n_flows_mutex);
381 /* Stops the handler and revalidator threads, must be enclosed in
382 * ovsrcu quiescent state unless when destroying udpif. */
384 udpif_stop_threads(struct udpif *udpif)
386 if (udpif && (udpif->n_handlers != 0 || udpif->n_revalidators != 0)) {
389 latch_set(&udpif->exit_latch);
391 for (i = 0; i < udpif->n_handlers; i++) {
392 struct handler *handler = &udpif->handlers[i];
394 xpthread_join(handler->thread, NULL);
397 for (i = 0; i < udpif->n_revalidators; i++) {
398 xpthread_join(udpif->revalidators[i].thread, NULL);
401 dpif_disable_upcall(udpif->dpif);
403 for (i = 0; i < udpif->n_revalidators; i++) {
404 struct revalidator *revalidator = &udpif->revalidators[i];
406 /* Delete ukeys, and delete all flows from the datapath to prevent
407 * double-counting stats. */
408 revalidator_purge(revalidator);
411 latch_poll(&udpif->exit_latch);
413 ovs_barrier_destroy(&udpif->reval_barrier);
415 free(udpif->revalidators);
416 udpif->revalidators = NULL;
417 udpif->n_revalidators = 0;
419 free(udpif->handlers);
420 udpif->handlers = NULL;
421 udpif->n_handlers = 0;
425 /* Starts the handler and revalidator threads, must be enclosed in
426 * ovsrcu quiescent state. */
428 udpif_start_threads(struct udpif *udpif, size_t n_handlers,
429 size_t n_revalidators)
431 if (udpif && n_handlers && n_revalidators) {
434 udpif->n_handlers = n_handlers;
435 udpif->n_revalidators = n_revalidators;
437 udpif->handlers = xzalloc(udpif->n_handlers * sizeof *udpif->handlers);
438 for (i = 0; i < udpif->n_handlers; i++) {
439 struct handler *handler = &udpif->handlers[i];
441 handler->udpif = udpif;
442 handler->handler_id = i;
443 handler->thread = ovs_thread_create(
444 "handler", udpif_upcall_handler, handler);
447 atomic_init(&udpif->enable_ufid, dpif_get_enable_ufid(udpif->dpif));
448 dpif_enable_upcall(udpif->dpif);
450 ovs_barrier_init(&udpif->reval_barrier, udpif->n_revalidators);
451 udpif->reval_exit = false;
452 udpif->revalidators = xzalloc(udpif->n_revalidators
453 * sizeof *udpif->revalidators);
454 for (i = 0; i < udpif->n_revalidators; i++) {
455 struct revalidator *revalidator = &udpif->revalidators[i];
457 revalidator->udpif = udpif;
458 revalidator->thread = ovs_thread_create(
459 "revalidator", udpif_revalidator, revalidator);
464 /* Tells 'udpif' how many threads it should use to handle upcalls.
465 * 'n_handlers' and 'n_revalidators' can never be zero. 'udpif''s
466 * datapath handle must have packet reception enabled before starting
469 udpif_set_threads(struct udpif *udpif, size_t n_handlers,
470 size_t n_revalidators)
473 ovs_assert(n_handlers && n_revalidators);
475 ovsrcu_quiesce_start();
476 if (udpif->n_handlers != n_handlers
477 || udpif->n_revalidators != n_revalidators) {
478 udpif_stop_threads(udpif);
481 if (!udpif->handlers && !udpif->revalidators) {
484 error = dpif_handlers_set(udpif->dpif, n_handlers);
486 VLOG_ERR("failed to configure handlers in dpif %s: %s",
487 dpif_name(udpif->dpif), ovs_strerror(error));
491 udpif_start_threads(udpif, n_handlers, n_revalidators);
493 ovsrcu_quiesce_end();
496 /* Waits for all ongoing upcall translations to complete. This ensures that
497 * there are no transient references to any removed ofprotos (or other
498 * objects). In particular, this should be called after an ofproto is removed
499 * (e.g. via xlate_remove_ofproto()) but before it is destroyed. */
501 udpif_synchronize(struct udpif *udpif)
503 /* This is stronger than necessary. It would be sufficient to ensure
504 * (somehow) that each handler and revalidator thread had passed through
505 * its main loop once. */
506 size_t n_handlers = udpif->n_handlers;
507 size_t n_revalidators = udpif->n_revalidators;
509 ovsrcu_quiesce_start();
510 udpif_stop_threads(udpif);
511 udpif_start_threads(udpif, n_handlers, n_revalidators);
512 ovsrcu_quiesce_end();
515 /* Notifies 'udpif' that something changed which may render previous
516 * xlate_actions() results invalid. */
518 udpif_revalidate(struct udpif *udpif)
520 seq_change(udpif->reval_seq);
523 /* Returns a seq which increments every time 'udpif' pulls stats from the
524 * datapath. Callers can use this to get a sense of when might be a good time
525 * to do periodic work which relies on relatively up to date statistics. */
527 udpif_dump_seq(struct udpif *udpif)
529 return udpif->dump_seq;
533 udpif_get_memory_usage(struct udpif *udpif, struct simap *usage)
537 simap_increase(usage, "handlers", udpif->n_handlers);
539 simap_increase(usage, "revalidators", udpif->n_revalidators);
540 for (i = 0; i < N_UMAPS; i++) {
541 simap_increase(usage, "udpif keys", cmap_count(&udpif->ukeys[i].cmap));
545 /* Remove flows from a single datapath. */
547 udpif_flush(struct udpif *udpif)
549 size_t n_handlers, n_revalidators;
551 n_handlers = udpif->n_handlers;
552 n_revalidators = udpif->n_revalidators;
554 ovsrcu_quiesce_start();
556 udpif_stop_threads(udpif);
557 dpif_flow_flush(udpif->dpif);
558 udpif_start_threads(udpif, n_handlers, n_revalidators);
560 ovsrcu_quiesce_end();
563 /* Removes all flows from all datapaths. */
565 udpif_flush_all_datapaths(void)
569 LIST_FOR_EACH (udpif, list_node, &all_udpifs) {
576 udpif_get_n_flows(struct udpif *udpif)
578 long long int time, now;
579 unsigned long flow_count;
582 atomic_read_relaxed(&udpif->n_flows_timestamp, &time);
583 if (time < now - 100 && !ovs_mutex_trylock(&udpif->n_flows_mutex)) {
584 struct dpif_dp_stats stats;
586 atomic_store_relaxed(&udpif->n_flows_timestamp, now);
587 dpif_get_dp_stats(udpif->dpif, &stats);
588 flow_count = stats.n_flows;
589 atomic_store_relaxed(&udpif->n_flows, flow_count);
590 ovs_mutex_unlock(&udpif->n_flows_mutex);
592 atomic_read_relaxed(&udpif->n_flows, &flow_count);
597 /* The upcall handler thread tries to read a batch of UPCALL_MAX_BATCH
598 * upcalls from dpif, processes the batch and installs corresponding flows
601 udpif_upcall_handler(void *arg)
603 struct handler *handler = arg;
604 struct udpif *udpif = handler->udpif;
606 while (!latch_is_set(&handler->udpif->exit_latch)) {
607 if (recv_upcalls(handler)) {
608 poll_immediate_wake();
610 dpif_recv_wait(udpif->dpif, handler->handler_id);
611 latch_wait(&udpif->exit_latch);
620 recv_upcalls(struct handler *handler)
622 struct udpif *udpif = handler->udpif;
623 uint64_t recv_stubs[UPCALL_MAX_BATCH][512 / 8];
624 struct ofpbuf recv_bufs[UPCALL_MAX_BATCH];
625 struct dpif_upcall dupcalls[UPCALL_MAX_BATCH];
626 struct upcall upcalls[UPCALL_MAX_BATCH];
627 struct flow flows[UPCALL_MAX_BATCH];
631 while (n_upcalls < UPCALL_MAX_BATCH) {
632 struct ofpbuf *recv_buf = &recv_bufs[n_upcalls];
633 struct dpif_upcall *dupcall = &dupcalls[n_upcalls];
634 struct upcall *upcall = &upcalls[n_upcalls];
635 struct flow *flow = &flows[n_upcalls];
636 struct pkt_metadata md;
639 ofpbuf_use_stub(recv_buf, recv_stubs[n_upcalls],
640 sizeof recv_stubs[n_upcalls]);
641 if (dpif_recv(udpif->dpif, handler->handler_id, dupcall, recv_buf)) {
642 ofpbuf_uninit(recv_buf);
646 if (odp_flow_key_to_flow(dupcall->key, dupcall->key_len, flow)
651 error = upcall_receive(upcall, udpif->backer, &dupcall->packet,
652 dupcall->type, dupcall->userdata, flow,
655 if (error == ENODEV) {
656 /* Received packet on datapath port for which we couldn't
657 * associate an ofproto. This can happen if a port is removed
658 * while traffic is being received. Print a rate-limited
659 * message in case it happens frequently. */
660 dpif_flow_put(udpif->dpif, DPIF_FP_CREATE, dupcall->key,
661 dupcall->key_len, NULL, 0, NULL, 0,
662 &dupcall->ufid, NULL);
663 VLOG_INFO_RL(&rl, "received packet on unassociated datapath "
664 "port %"PRIu32, flow->in_port.odp_port);
669 upcall->key = dupcall->key;
670 upcall->key_len = dupcall->key_len;
671 upcall->ufid = &dupcall->ufid;
673 upcall->out_tun_key = dupcall->out_tun_key;
675 if (vsp_adjust_flow(upcall->ofproto, flow, &dupcall->packet)) {
676 upcall->vsp_adjusted = true;
679 md = pkt_metadata_from_flow(flow);
680 flow_extract(&dupcall->packet, &md, flow);
682 error = process_upcall(udpif, upcall, NULL);
691 upcall_uninit(upcall);
693 ofpbuf_uninit(&dupcall->packet);
694 ofpbuf_uninit(recv_buf);
698 handle_upcalls(handler->udpif, upcalls, n_upcalls);
699 for (i = 0; i < n_upcalls; i++) {
700 ofpbuf_uninit(&dupcalls[i].packet);
701 ofpbuf_uninit(&recv_bufs[i]);
702 upcall_uninit(&upcalls[i]);
710 udpif_revalidator(void *arg)
712 /* Used by all revalidators. */
713 struct revalidator *revalidator = arg;
714 struct udpif *udpif = revalidator->udpif;
715 bool leader = revalidator == &udpif->revalidators[0];
717 /* Used only by the leader. */
718 long long int start_time = 0;
719 uint64_t last_reval_seq = 0;
722 revalidator->id = ovsthread_id_self();
727 reval_seq = seq_read(udpif->reval_seq);
728 last_reval_seq = reval_seq;
730 n_flows = udpif_get_n_flows(udpif);
731 udpif->max_n_flows = MAX(n_flows, udpif->max_n_flows);
732 udpif->avg_n_flows = (udpif->avg_n_flows + n_flows) / 2;
734 /* Only the leader checks the exit latch to prevent a race where
735 * some threads think it's true and exit and others think it's
736 * false and block indefinitely on the reval_barrier */
737 udpif->reval_exit = latch_is_set(&udpif->exit_latch);
739 start_time = time_msec();
740 if (!udpif->reval_exit) {
743 atomic_read_relaxed(&udpif->enable_ufid, &terse_dump);
744 udpif->dump = dpif_flow_dump_create(udpif->dpif, terse_dump);
748 /* Wait for the leader to start the flow dump. */
749 ovs_barrier_block(&udpif->reval_barrier);
750 if (udpif->reval_exit) {
753 revalidate(revalidator);
755 /* Wait for all flows to have been dumped before we garbage collect. */
756 ovs_barrier_block(&udpif->reval_barrier);
757 revalidator_sweep(revalidator);
759 /* Wait for all revalidators to finish garbage collection. */
760 ovs_barrier_block(&udpif->reval_barrier);
763 unsigned int flow_limit;
764 long long int duration;
766 atomic_read_relaxed(&udpif->flow_limit, &flow_limit);
768 dpif_flow_dump_destroy(udpif->dump);
769 seq_change(udpif->dump_seq);
771 duration = MAX(time_msec() - start_time, 1);
772 udpif->dump_duration = duration;
773 if (duration > 2000) {
774 flow_limit /= duration / 1000;
775 } else if (duration > 1300) {
776 flow_limit = flow_limit * 3 / 4;
777 } else if (duration < 1000 && n_flows > 2000
778 && flow_limit < n_flows * 1000 / duration) {
781 flow_limit = MIN(ofproto_flow_limit, MAX(flow_limit, 1000));
782 atomic_store_relaxed(&udpif->flow_limit, flow_limit);
784 if (duration > 2000) {
785 VLOG_INFO("Spent an unreasonably long %lldms dumping flows",
789 poll_timer_wait_until(start_time + MIN(ofproto_max_idle, 500));
790 seq_wait(udpif->reval_seq, last_reval_seq);
791 latch_wait(&udpif->exit_latch);
799 static enum upcall_type
800 classify_upcall(enum dpif_upcall_type type, const struct nlattr *userdata)
802 union user_action_cookie cookie;
805 /* First look at the upcall type. */
813 case DPIF_N_UC_TYPES:
815 VLOG_WARN_RL(&rl, "upcall has unexpected type %"PRIu32, type);
819 /* "action" upcalls need a closer look. */
821 VLOG_WARN_RL(&rl, "action upcall missing cookie");
824 userdata_len = nl_attr_get_size(userdata);
825 if (userdata_len < sizeof cookie.type
826 || userdata_len > sizeof cookie) {
827 VLOG_WARN_RL(&rl, "action upcall cookie has unexpected size %"PRIuSIZE,
831 memset(&cookie, 0, sizeof cookie);
832 memcpy(&cookie, nl_attr_get(userdata), userdata_len);
833 if (userdata_len == MAX(8, sizeof cookie.sflow)
834 && cookie.type == USER_ACTION_COOKIE_SFLOW) {
836 } else if (userdata_len == MAX(8, sizeof cookie.slow_path)
837 && cookie.type == USER_ACTION_COOKIE_SLOW_PATH) {
839 } else if (userdata_len == MAX(8, sizeof cookie.flow_sample)
840 && cookie.type == USER_ACTION_COOKIE_FLOW_SAMPLE) {
841 return FLOW_SAMPLE_UPCALL;
842 } else if (userdata_len == MAX(8, sizeof cookie.ipfix)
843 && cookie.type == USER_ACTION_COOKIE_IPFIX) {
846 VLOG_WARN_RL(&rl, "invalid user cookie of type %"PRIu16
847 " and size %"PRIuSIZE, cookie.type, userdata_len);
852 /* Calculates slow path actions for 'xout'. 'buf' must statically be
853 * initialized with at least 128 bytes of space. */
855 compose_slow_path(struct udpif *udpif, struct xlate_out *xout,
856 const struct flow *flow, odp_port_t odp_in_port,
859 union user_action_cookie cookie;
863 cookie.type = USER_ACTION_COOKIE_SLOW_PATH;
864 cookie.slow_path.unused = 0;
865 cookie.slow_path.reason = xout->slow;
867 port = xout->slow & (SLOW_CFM | SLOW_BFD | SLOW_LACP | SLOW_STP)
870 pid = dpif_port_get_pid(udpif->dpif, port, flow_hash_5tuple(flow, 0));
871 odp_put_userspace_action(pid, &cookie, sizeof cookie.slow_path, ODPP_NONE,
875 /* If there is no error, the upcall must be destroyed with upcall_uninit()
876 * before quiescing, as the referred objects are guaranteed to exist only
877 * until the calling thread quiesces. Otherwise, do not call upcall_uninit()
878 * since the 'upcall->put_actions' remains uninitialized. */
880 upcall_receive(struct upcall *upcall, const struct dpif_backer *backer,
881 const struct ofpbuf *packet, enum dpif_upcall_type type,
882 const struct nlattr *userdata, const struct flow *flow,
883 const ovs_u128 *ufid)
887 error = xlate_lookup(backer, flow, &upcall->ofproto, &upcall->ipfix,
888 &upcall->sflow, NULL, &upcall->in_port);
894 upcall->packet = packet;
897 upcall->userdata = userdata;
898 ofpbuf_init(&upcall->put_actions, 0);
900 upcall->xout_initialized = false;
901 upcall->vsp_adjusted = false;
902 upcall->ukey_persists = false;
908 upcall->out_tun_key = NULL;
914 upcall_xlate(struct udpif *udpif, struct upcall *upcall,
915 struct ofpbuf *odp_actions)
917 struct dpif_flow_stats stats;
921 stats.n_bytes = ofpbuf_size(upcall->packet);
922 stats.used = time_msec();
923 stats.tcp_flags = ntohs(upcall->flow->tcp_flags);
925 xlate_in_init(&xin, upcall->ofproto, upcall->flow, upcall->in_port, NULL,
926 stats.tcp_flags, upcall->packet);
927 xin.odp_actions = odp_actions;
929 if (upcall->type == DPIF_UC_MISS) {
930 xin.resubmit_stats = &stats;
932 /* For non-miss upcalls, there's a flow in the datapath which this
933 * packet was accounted to. Presumably the revalidators will deal
934 * with pushing its stats eventually. */
937 upcall->dump_seq = seq_read(udpif->dump_seq);
938 upcall->reval_seq = seq_read(udpif->reval_seq);
939 xlate_actions(&xin, &upcall->xout);
940 upcall->xout_initialized = true;
942 /* Special case for fail-open mode.
944 * If we are in fail-open mode, but we are connected to a controller too,
945 * then we should send the packet up to the controller in the hope that it
946 * will try to set up a flow and thereby allow us to exit fail-open.
948 * See the top-level comment in fail-open.c for more information.
950 * Copy packets before they are modified by execution. */
951 if (upcall->xout.fail_open) {
952 const struct ofpbuf *packet = upcall->packet;
953 struct ofproto_packet_in *pin;
955 pin = xmalloc(sizeof *pin);
956 pin->up.packet = xmemdup(ofpbuf_data(packet), ofpbuf_size(packet));
957 pin->up.packet_len = ofpbuf_size(packet);
958 pin->up.reason = OFPR_NO_MATCH;
959 pin->up.table_id = 0;
960 pin->up.cookie = OVS_BE64_MAX;
961 flow_get_metadata(upcall->flow, &pin->up.fmd);
962 pin->send_len = 0; /* Not used for flow table misses. */
963 pin->miss_type = OFPROTO_PACKET_IN_NO_MISS;
964 ofproto_dpif_send_packet_in(upcall->ofproto, pin);
967 if (!upcall->xout.slow) {
968 ofpbuf_use_const(&upcall->put_actions,
969 ofpbuf_data(upcall->xout.odp_actions),
970 ofpbuf_size(upcall->xout.odp_actions));
972 ofpbuf_init(&upcall->put_actions, 0);
973 compose_slow_path(udpif, &upcall->xout, upcall->flow,
974 upcall->flow->in_port.odp_port,
975 &upcall->put_actions);
978 upcall->ukey = ukey_create_from_upcall(upcall);
982 upcall_uninit(struct upcall *upcall)
985 if (upcall->xout_initialized) {
986 xlate_out_uninit(&upcall->xout);
988 ofpbuf_uninit(&upcall->put_actions);
989 if (!upcall->ukey_persists) {
990 ukey_delete__(upcall->ukey);
996 upcall_cb(const struct ofpbuf *packet, const struct flow *flow, ovs_u128 *ufid,
997 enum dpif_upcall_type type, const struct nlattr *userdata,
998 struct ofpbuf *actions, struct flow_wildcards *wc,
999 struct ofpbuf *put_actions, void *aux)
1001 struct udpif *udpif = aux;
1002 unsigned int flow_limit;
1003 struct upcall upcall;
1007 atomic_read_relaxed(&enable_megaflows, &megaflow);
1008 atomic_read_relaxed(&udpif->flow_limit, &flow_limit);
1010 error = upcall_receive(&upcall, udpif->backer, packet, type, userdata,
1016 error = process_upcall(udpif, &upcall, actions);
1021 if (upcall.xout.slow && put_actions) {
1022 ofpbuf_put(put_actions, ofpbuf_data(&upcall.put_actions),
1023 ofpbuf_size(&upcall.put_actions));
1026 if (OVS_LIKELY(wc)) {
1028 /* XXX: This could be avoided with sufficient API changes. */
1029 *wc = upcall.xout.wc;
1031 flow_wildcards_init_for_packet(wc, flow);
1035 if (udpif_get_n_flows(udpif) >= flow_limit) {
1040 if (upcall.ukey && !ukey_install(udpif, upcall.ukey)) {
1046 upcall.ukey_persists = true;
1048 upcall_uninit(&upcall);
1053 process_upcall(struct udpif *udpif, struct upcall *upcall,
1054 struct ofpbuf *odp_actions)
1056 const struct nlattr *userdata = upcall->userdata;
1057 const struct ofpbuf *packet = upcall->packet;
1058 const struct flow *flow = upcall->flow;
1060 switch (classify_upcall(upcall->type, userdata)) {
1062 upcall_xlate(udpif, upcall, odp_actions);
1066 if (upcall->sflow) {
1067 union user_action_cookie cookie;
1069 memset(&cookie, 0, sizeof cookie);
1070 memcpy(&cookie, nl_attr_get(userdata), sizeof cookie.sflow);
1071 dpif_sflow_received(upcall->sflow, packet, flow,
1072 flow->in_port.odp_port, &cookie);
1077 if (upcall->ipfix) {
1078 union user_action_cookie cookie;
1079 struct flow_tnl output_tunnel_key;
1081 memset(&cookie, 0, sizeof cookie);
1082 memcpy(&cookie, nl_attr_get(userdata), sizeof cookie.ipfix);
1084 if (upcall->out_tun_key) {
1085 memset(&output_tunnel_key, 0, sizeof output_tunnel_key);
1086 odp_tun_key_from_attr(upcall->out_tun_key,
1087 &output_tunnel_key);
1089 dpif_ipfix_bridge_sample(upcall->ipfix, packet, flow,
1090 flow->in_port.odp_port,
1091 cookie.ipfix.output_odp_port,
1092 upcall->out_tun_key ?
1093 &output_tunnel_key : NULL);
1097 case FLOW_SAMPLE_UPCALL:
1098 if (upcall->ipfix) {
1099 union user_action_cookie cookie;
1101 memset(&cookie, 0, sizeof cookie);
1102 memcpy(&cookie, nl_attr_get(userdata), sizeof cookie.flow_sample);
1104 /* The flow reflects exactly the contents of the packet.
1105 * Sample the packet using it. */
1106 dpif_ipfix_flow_sample(upcall->ipfix, packet, flow,
1107 cookie.flow_sample.collector_set_id,
1108 cookie.flow_sample.probability,
1109 cookie.flow_sample.obs_domain_id,
1110 cookie.flow_sample.obs_point_id);
1122 handle_upcalls(struct udpif *udpif, struct upcall *upcalls,
1125 struct dpif_op *opsp[UPCALL_MAX_BATCH * 2];
1126 struct ukey_op ops[UPCALL_MAX_BATCH * 2];
1127 unsigned int flow_limit;
1128 size_t n_ops, n_opsp, i;
1132 atomic_read_relaxed(&udpif->flow_limit, &flow_limit);
1133 atomic_read_relaxed(&enable_megaflows, &megaflow);
1135 may_put = udpif_get_n_flows(udpif) < flow_limit;
1137 /* Handle the packets individually in order of arrival.
1139 * - For SLOW_CFM, SLOW_LACP, SLOW_STP, and SLOW_BFD, translation is what
1140 * processes received packets for these protocols.
1142 * - For SLOW_CONTROLLER, translation sends the packet to the OpenFlow
1145 * The loop fills 'ops' with an array of operations to execute in the
1148 for (i = 0; i < n_upcalls; i++) {
1149 struct upcall *upcall = &upcalls[i];
1150 const struct ofpbuf *packet = upcall->packet;
1153 if (upcall->vsp_adjusted) {
1154 /* This packet was received on a VLAN splinter port. We added a
1155 * VLAN to the packet to make the packet resemble the flow, but the
1156 * actions were composed assuming that the packet contained no
1157 * VLAN. So, we must remove the VLAN header from the packet before
1158 * trying to execute the actions. */
1159 if (ofpbuf_size(upcall->xout.odp_actions)) {
1160 eth_pop_vlan(CONST_CAST(struct ofpbuf *, upcall->packet));
1163 /* Remove the flow vlan tags inserted by vlan splinter logic
1164 * to ensure megaflow masks generated match the data path flow. */
1165 CONST_CAST(struct flow *, upcall->flow)->vlan_tci = 0;
1168 /* Do not install a flow into the datapath if:
1170 * - The datapath already has too many flows.
1172 * - We received this packet via some flow installed in the kernel
1174 if (may_put && upcall->type == DPIF_UC_MISS) {
1175 struct udpif_key *ukey = upcall->ukey;
1177 upcall->ukey_persists = true;
1181 op->dop.type = DPIF_OP_FLOW_PUT;
1182 op->dop.u.flow_put.flags = DPIF_FP_CREATE;
1183 op->dop.u.flow_put.key = ukey->key;
1184 op->dop.u.flow_put.key_len = ukey->key_len;
1185 op->dop.u.flow_put.mask = ukey->mask;
1186 op->dop.u.flow_put.mask_len = ukey->mask_len;
1187 op->dop.u.flow_put.ufid = upcall->ufid;
1188 op->dop.u.flow_put.stats = NULL;
1189 op->dop.u.flow_put.actions = ofpbuf_data(ukey->actions);
1190 op->dop.u.flow_put.actions_len = ofpbuf_size(ukey->actions);
1193 if (ofpbuf_size(upcall->xout.odp_actions)) {
1196 op->dop.type = DPIF_OP_EXECUTE;
1197 op->dop.u.execute.packet = CONST_CAST(struct ofpbuf *, packet);
1198 odp_key_to_pkt_metadata(upcall->key, upcall->key_len,
1199 &op->dop.u.execute.md);
1200 op->dop.u.execute.actions = ofpbuf_data(upcall->xout.odp_actions);
1201 op->dop.u.execute.actions_len = ofpbuf_size(upcall->xout.odp_actions);
1202 op->dop.u.execute.needs_help = (upcall->xout.slow & SLOW_ACTION) != 0;
1203 op->dop.u.execute.probe = false;
1209 * We install ukeys before installing the flows, locking them for exclusive
1210 * access by this thread for the period of installation. This ensures that
1211 * other threads won't attempt to delete the flows as we are creating them.
1214 for (i = 0; i < n_ops; i++) {
1215 struct udpif_key *ukey = ops[i].ukey;
1218 /* If we can't install the ukey, don't install the flow. */
1219 if (!ukey_install_start(udpif, ukey)) {
1220 ukey_delete__(ukey);
1225 opsp[n_opsp++] = &ops[i].dop;
1227 dpif_operate(udpif->dpif, opsp, n_opsp);
1228 for (i = 0; i < n_ops; i++) {
1230 ukey_install_finish(ops[i].ukey, ops[i].dop.error);
1236 get_ufid_hash(const ovs_u128 *ufid)
1238 return ufid->u32[0];
1241 static struct udpif_key *
1242 ukey_lookup(struct udpif *udpif, const ovs_u128 *ufid)
1244 struct udpif_key *ukey;
1245 int idx = get_ufid_hash(ufid) % N_UMAPS;
1246 struct cmap *cmap = &udpif->ukeys[idx].cmap;
1248 CMAP_FOR_EACH_WITH_HASH (ukey, cmap_node, get_ufid_hash(ufid), cmap) {
1249 if (ovs_u128_equal(&ukey->ufid, ufid)) {
1256 static struct udpif_key *
1257 ukey_create__(const struct nlattr *key, size_t key_len,
1258 const struct nlattr *mask, size_t mask_len,
1259 bool ufid_present, const ovs_u128 *ufid,
1260 const struct ofpbuf *actions,
1261 uint64_t dump_seq, uint64_t reval_seq, long long int used)
1262 OVS_NO_THREAD_SAFETY_ANALYSIS
1264 struct udpif_key *ukey = xmalloc(sizeof *ukey);
1266 memcpy(&ukey->keybuf, key, key_len);
1267 ukey->key = &ukey->keybuf.nla;
1268 ukey->key_len = key_len;
1269 memcpy(&ukey->maskbuf, mask, mask_len);
1270 ukey->mask = &ukey->maskbuf.nla;
1271 ukey->mask_len = mask_len;
1272 ukey->ufid_present = ufid_present;
1274 ukey->hash = get_ufid_hash(&ukey->ufid);
1275 ukey->actions = ofpbuf_clone(actions);
1277 ovs_mutex_init(&ukey->mutex);
1278 ukey->dump_seq = dump_seq;
1279 ukey->reval_seq = reval_seq;
1280 ukey->flow_exists = false;
1281 ukey->created = time_msec();
1282 memset(&ukey->stats, 0, sizeof ukey->stats);
1283 ukey->stats.used = used;
1284 ukey->xcache = NULL;
1289 static struct udpif_key *
1290 ukey_create_from_upcall(const struct upcall *upcall)
1292 struct odputil_keybuf keystub, maskstub;
1293 struct ofpbuf keybuf, maskbuf;
1294 bool recirc, megaflow;
1296 if (upcall->key_len) {
1297 ofpbuf_use_const(&keybuf, upcall->key, upcall->key_len);
1299 /* dpif-netdev doesn't provide a netlink-formatted flow key in the
1300 * upcall, so convert the upcall's flow here. */
1301 ofpbuf_use_stack(&keybuf, &keystub, sizeof keystub);
1302 odp_flow_key_from_flow(&keybuf, upcall->flow, &upcall->xout.wc.masks,
1303 upcall->flow->in_port.odp_port, true);
1306 atomic_read_relaxed(&enable_megaflows, &megaflow);
1307 recirc = ofproto_dpif_get_enable_recirc(upcall->ofproto);
1308 ofpbuf_use_stack(&maskbuf, &maskstub, sizeof maskstub);
1312 max_mpls = ofproto_dpif_get_max_mpls_depth(upcall->ofproto);
1313 odp_flow_key_from_mask(&maskbuf, &upcall->xout.wc.masks, upcall->flow,
1314 UINT32_MAX, max_mpls, recirc);
1317 return ukey_create__(ofpbuf_data(&keybuf), ofpbuf_size(&keybuf),
1318 ofpbuf_data(&maskbuf), ofpbuf_size(&maskbuf),
1319 true, upcall->ufid, &upcall->put_actions,
1320 upcall->dump_seq, upcall->reval_seq, 0);
1324 ukey_create_from_dpif_flow(const struct udpif *udpif,
1325 const struct dpif_flow *flow,
1326 struct udpif_key **ukey)
1328 struct dpif_flow full_flow;
1329 struct ofpbuf actions;
1330 uint64_t dump_seq, reval_seq;
1331 uint64_t stub[DPIF_FLOW_BUFSIZE / 8];
1333 if (!flow->key_len) {
1337 /* If the key was not provided by the datapath, fetch the full flow. */
1338 ofpbuf_use_stack(&buf, &stub, sizeof stub);
1339 err = dpif_flow_get(udpif->dpif, NULL, 0, &flow->ufid, &buf,
1346 dump_seq = seq_read(udpif->dump_seq);
1347 reval_seq = seq_read(udpif->reval_seq);
1348 ofpbuf_use_const(&actions, &flow->actions, flow->actions_len);
1349 *ukey = ukey_create__(flow->key, flow->key_len,
1350 flow->mask, flow->mask_len, flow->ufid_present,
1351 &flow->ufid, &actions, dump_seq, reval_seq,
1356 /* Attempts to insert a ukey into the shared ukey maps.
1358 * On success, returns true, installs the ukey and returns it in a locked
1359 * state. Otherwise, returns false. */
1361 ukey_install_start(struct udpif *udpif, struct udpif_key *new_ukey)
1362 OVS_TRY_LOCK(true, new_ukey->mutex)
1365 struct udpif_key *old_ukey;
1367 bool locked = false;
1369 idx = new_ukey->hash % N_UMAPS;
1370 umap = &udpif->ukeys[idx];
1371 ovs_mutex_lock(&umap->mutex);
1372 old_ukey = ukey_lookup(udpif, &new_ukey->ufid);
1374 /* Uncommon case: A ukey is already installed with the same UFID. */
1375 if (old_ukey->key_len == new_ukey->key_len
1376 && !memcmp(old_ukey->key, new_ukey->key, new_ukey->key_len)) {
1377 COVERAGE_INC(handler_duplicate_upcall);
1379 struct ds ds = DS_EMPTY_INITIALIZER;
1381 odp_format_ufid(&old_ukey->ufid, &ds);
1382 ds_put_cstr(&ds, " ");
1383 odp_flow_key_format(old_ukey->key, old_ukey->key_len, &ds);
1384 ds_put_cstr(&ds, "\n");
1385 odp_format_ufid(&new_ukey->ufid, &ds);
1386 ds_put_cstr(&ds, " ");
1387 odp_flow_key_format(new_ukey->key, new_ukey->key_len, &ds);
1389 VLOG_WARN_RL(&rl, "Conflicting ukey for flows:\n%s", ds_cstr(&ds));
1393 ovs_mutex_lock(&new_ukey->mutex);
1394 cmap_insert(&umap->cmap, &new_ukey->cmap_node, new_ukey->hash);
1397 ovs_mutex_unlock(&umap->mutex);
1403 ukey_install_finish__(struct udpif_key *ukey) OVS_REQUIRES(ukey->mutex)
1405 ukey->flow_exists = true;
1409 ukey_install_finish(struct udpif_key *ukey, int error)
1410 OVS_RELEASES(ukey->mutex)
1413 ukey_install_finish__(ukey);
1415 ovs_mutex_unlock(&ukey->mutex);
1421 ukey_install(struct udpif *udpif, struct udpif_key *ukey)
1423 /* The usual way to keep 'ukey->flow_exists' in sync with the datapath is
1424 * to call ukey_install_start(), install the corresponding datapath flow,
1425 * then call ukey_install_finish(). The netdev interface using upcall_cb()
1426 * doesn't provide a function to separately finish the flow installation,
1427 * so we perform the operations together here.
1429 * This is fine currently, as revalidator threads will only delete this
1430 * ukey during revalidator_sweep() and only if the dump_seq is mismatched.
1431 * It is unlikely for a revalidator thread to advance dump_seq and reach
1432 * the next GC phase between ukey creation and flow installation. */
1433 return ukey_install_start(udpif, ukey) && ukey_install_finish(ukey, 0);
1436 /* Searches for a ukey in 'udpif->ukeys' that matches 'flow' and attempts to
1437 * lock the ukey. If the ukey does not exist, create it.
1439 * Returns 0 on success, setting *result to the matching ukey and returning it
1440 * in a locked state. Otherwise, returns an errno and clears *result. EBUSY
1441 * indicates that another thread is handling this flow. Other errors indicate
1442 * an unexpected condition creating a new ukey.
1444 * *error is an output parameter provided to appease the threadsafety analyser,
1445 * and its value matches the return value. */
1447 ukey_acquire(struct udpif *udpif, const struct dpif_flow *flow,
1448 struct udpif_key **result, int *error)
1449 OVS_TRY_LOCK(0, (*result)->mutex)
1451 struct udpif_key *ukey;
1454 ukey = ukey_lookup(udpif, &flow->ufid);
1456 retval = ovs_mutex_trylock(&ukey->mutex);
1458 /* Usually we try to avoid installing flows from revalidator threads,
1459 * because locking on a umap may cause handler threads to block.
1460 * However there are certain cases, like when ovs-vswitchd is
1461 * restarted, where it is desirable to handle flows that exist in the
1462 * datapath gracefully (ie, don't just clear the datapath). */
1465 retval = ukey_create_from_dpif_flow(udpif, flow, &ukey);
1469 install = ukey_install_start(udpif, ukey);
1471 ukey_install_finish__(ukey);
1474 ukey_delete__(ukey);
1490 ukey_delete__(struct udpif_key *ukey)
1491 OVS_NO_THREAD_SAFETY_ANALYSIS
1494 xlate_cache_delete(ukey->xcache);
1495 ofpbuf_delete(ukey->actions);
1496 ovs_mutex_destroy(&ukey->mutex);
1502 ukey_delete(struct umap *umap, struct udpif_key *ukey)
1503 OVS_REQUIRES(umap->mutex)
1505 cmap_remove(&umap->cmap, &ukey->cmap_node, ukey->hash);
1506 ovsrcu_postpone(ukey_delete__, ukey);
1510 should_revalidate(const struct udpif *udpif, uint64_t packets,
1513 long long int metric, now, duration;
1515 if (udpif->dump_duration < 200) {
1516 /* We are likely to handle full revalidation for the flows. */
1520 /* Calculate the mean time between seeing these packets. If this
1521 * exceeds the threshold, then delete the flow rather than performing
1522 * costly revalidation for flows that aren't being hit frequently.
1524 * This is targeted at situations where the dump_duration is high (~1s),
1525 * and revalidation is triggered by a call to udpif_revalidate(). In
1526 * these situations, revalidation of all flows causes fluctuations in the
1527 * flow_limit due to the interaction with the dump_duration and max_idle.
1528 * This tends to result in deletion of low-throughput flows anyway, so
1529 * skip the revalidation and just delete those flows. */
1530 packets = MAX(packets, 1);
1531 now = MAX(used, time_msec());
1532 duration = now - used;
1533 metric = duration / packets;
1536 /* The flow is receiving more than ~5pps, so keep it. */
1543 revalidate_ukey(struct udpif *udpif, struct udpif_key *ukey,
1544 const struct dpif_flow_stats *stats, uint64_t reval_seq)
1545 OVS_REQUIRES(ukey->mutex)
1547 uint64_t slow_path_buf[128 / 8];
1548 struct xlate_out xout, *xoutp;
1549 struct netflow *netflow;
1550 struct ofproto_dpif *ofproto;
1551 struct dpif_flow_stats push;
1552 struct ofpbuf xout_actions;
1553 struct flow flow, dp_mask;
1554 uint32_t *dp32, *xout32;
1555 ofp_port_t ofp_in_port;
1556 struct xlate_in xin;
1557 long long int last_used;
1561 bool need_revalidate;
1567 need_revalidate = (ukey->reval_seq != reval_seq);
1568 last_used = ukey->stats.used;
1569 push.used = stats->used;
1570 push.tcp_flags = stats->tcp_flags;
1571 push.n_packets = (stats->n_packets > ukey->stats.n_packets
1572 ? stats->n_packets - ukey->stats.n_packets
1574 push.n_bytes = (stats->n_bytes > ukey->stats.n_bytes
1575 ? stats->n_bytes - ukey->stats.n_bytes
1578 if (need_revalidate && last_used
1579 && !should_revalidate(udpif, push.n_packets, last_used)) {
1584 /* We will push the stats, so update the ukey stats cache. */
1585 ukey->stats = *stats;
1586 if (!push.n_packets && !need_revalidate) {
1591 if (ukey->xcache && !need_revalidate) {
1592 xlate_push_stats(ukey->xcache, &push);
1597 if (odp_flow_key_to_flow(ukey->key, ukey->key_len, &flow)
1602 error = xlate_lookup(udpif->backer, &flow, &ofproto, NULL, NULL, &netflow,
1608 if (need_revalidate) {
1609 xlate_cache_clear(ukey->xcache);
1611 if (!ukey->xcache) {
1612 ukey->xcache = xlate_cache_new();
1615 xlate_in_init(&xin, ofproto, &flow, ofp_in_port, NULL, push.tcp_flags,
1617 if (push.n_packets) {
1618 xin.resubmit_stats = &push;
1619 xin.may_learn = true;
1621 xin.xcache = ukey->xcache;
1622 xin.skip_wildcards = !need_revalidate;
1623 xlate_actions(&xin, &xout);
1626 if (!need_revalidate) {
1632 ofpbuf_use_const(&xout_actions, ofpbuf_data(xout.odp_actions),
1633 ofpbuf_size(xout.odp_actions));
1635 ofpbuf_use_stack(&xout_actions, slow_path_buf, sizeof slow_path_buf);
1636 compose_slow_path(udpif, &xout, &flow, flow.in_port.odp_port,
1640 if (!ofpbuf_equal(&xout_actions, ukey->actions)) {
1644 if (odp_flow_key_to_mask(ukey->mask, ukey->mask_len, &dp_mask, &flow)
1649 /* Since the kernel is free to ignore wildcarded bits in the mask, we can't
1650 * directly check that the masks are the same. Instead we check that the
1651 * mask in the kernel is more specific i.e. less wildcarded, than what
1652 * we've calculated here. This guarantees we don't catch any packets we
1653 * shouldn't with the megaflow. */
1654 dp32 = (uint32_t *) &dp_mask;
1655 xout32 = (uint32_t *) &xout.wc.masks;
1656 for (i = 0; i < FLOW_U32S; i++) {
1657 if ((dp32[i] | xout32[i]) != dp32[i]) {
1666 ukey->reval_seq = reval_seq;
1668 if (netflow && !ok) {
1669 netflow_flow_clear(netflow, &flow);
1671 xlate_out_uninit(xoutp);
1676 delete_op_init__(struct ukey_op *op, const struct dpif_flow *flow)
1679 op->dop.type = DPIF_OP_FLOW_DEL;
1680 op->dop.u.flow_del.key = flow->key;
1681 op->dop.u.flow_del.key_len = flow->key_len;
1682 op->dop.u.flow_del.ufid = flow->ufid_present ? &flow->ufid : NULL;
1683 op->dop.u.flow_del.stats = &op->stats;
1687 delete_op_init(struct ukey_op *op, struct udpif_key *ukey)
1690 op->dop.type = DPIF_OP_FLOW_DEL;
1691 op->dop.u.flow_del.key = ukey->key;
1692 op->dop.u.flow_del.key_len = ukey->key_len;
1693 op->dop.u.flow_del.ufid = ukey->ufid_present ? &ukey->ufid : NULL;
1694 op->dop.u.flow_del.stats = &op->stats;
1698 push_ukey_ops__(struct udpif *udpif, struct ukey_op *ops, size_t n_ops)
1700 struct dpif_op *opsp[REVALIDATE_MAX_BATCH];
1703 ovs_assert(n_ops <= REVALIDATE_MAX_BATCH);
1704 for (i = 0; i < n_ops; i++) {
1705 opsp[i] = &ops[i].dop;
1707 dpif_operate(udpif->dpif, opsp, n_ops);
1709 for (i = 0; i < n_ops; i++) {
1710 struct ukey_op *op = &ops[i];
1711 struct dpif_flow_stats *push, *stats, push_buf;
1713 stats = op->dop.u.flow_del.stats;
1717 ovs_mutex_lock(&op->ukey->mutex);
1718 push->used = MAX(stats->used, op->ukey->stats.used);
1719 push->tcp_flags = stats->tcp_flags | op->ukey->stats.tcp_flags;
1720 push->n_packets = stats->n_packets - op->ukey->stats.n_packets;
1721 push->n_bytes = stats->n_bytes - op->ukey->stats.n_bytes;
1722 ovs_mutex_unlock(&op->ukey->mutex);
1727 if (push->n_packets || netflow_exists()) {
1728 const struct nlattr *key = op->dop.u.flow_del.key;
1729 size_t key_len = op->dop.u.flow_del.key_len;
1730 struct ofproto_dpif *ofproto;
1731 struct netflow *netflow;
1732 ofp_port_t ofp_in_port;
1737 ovs_mutex_lock(&op->ukey->mutex);
1738 if (op->ukey->xcache) {
1739 xlate_push_stats(op->ukey->xcache, push);
1740 ovs_mutex_unlock(&op->ukey->mutex);
1743 ovs_mutex_unlock(&op->ukey->mutex);
1744 key = op->ukey->key;
1745 key_len = op->ukey->key_len;
1748 if (odp_flow_key_to_flow(key, key_len, &flow)
1753 error = xlate_lookup(udpif->backer, &flow, &ofproto,
1754 NULL, NULL, &netflow, &ofp_in_port);
1756 struct xlate_in xin;
1758 xlate_in_init(&xin, ofproto, &flow, ofp_in_port, NULL,
1759 push->tcp_flags, NULL);
1760 xin.resubmit_stats = push->n_packets ? push : NULL;
1761 xin.may_learn = push->n_packets > 0;
1762 xin.skip_wildcards = true;
1763 xlate_actions_for_side_effects(&xin);
1766 netflow_flow_clear(netflow, &flow);
1774 push_ukey_ops(struct udpif *udpif, struct umap *umap,
1775 struct ukey_op *ops, size_t n_ops)
1779 push_ukey_ops__(udpif, ops, n_ops);
1780 ovs_mutex_lock(&umap->mutex);
1781 for (i = 0; i < n_ops; i++) {
1782 ukey_delete(umap, ops[i].ukey);
1784 ovs_mutex_unlock(&umap->mutex);
1788 log_unexpected_flow(const struct dpif_flow *flow, int error)
1790 static struct vlog_rate_limit rl = VLOG_RATE_LIMIT_INIT(10, 60);
1791 struct ds ds = DS_EMPTY_INITIALIZER;
1793 ds_put_format(&ds, "Failed to acquire udpif_key corresponding to "
1794 "unexpected flow (%s): ", ovs_strerror(error));
1795 odp_format_ufid(&flow->ufid, &ds);
1796 VLOG_WARN_RL(&rl, "%s", ds_cstr(&ds));
1800 revalidate(struct revalidator *revalidator)
1802 struct udpif *udpif = revalidator->udpif;
1803 struct dpif_flow_dump_thread *dump_thread;
1804 uint64_t dump_seq, reval_seq;
1805 unsigned int flow_limit;
1807 dump_seq = seq_read(udpif->dump_seq);
1808 reval_seq = seq_read(udpif->reval_seq);
1809 atomic_read_relaxed(&udpif->flow_limit, &flow_limit);
1810 dump_thread = dpif_flow_dump_thread_create(udpif->dump);
1812 struct ukey_op ops[REVALIDATE_MAX_BATCH];
1815 struct dpif_flow flows[REVALIDATE_MAX_BATCH];
1816 const struct dpif_flow *f;
1819 long long int max_idle;
1824 n_dumped = dpif_flow_dump_next(dump_thread, flows, ARRAY_SIZE(flows));
1831 /* In normal operation we want to keep flows around until they have
1832 * been idle for 'ofproto_max_idle' milliseconds. However:
1834 * - If the number of datapath flows climbs above 'flow_limit',
1835 * drop that down to 100 ms to try to bring the flows down to
1838 * - If the number of datapath flows climbs above twice
1839 * 'flow_limit', delete all the datapath flows as an emergency
1840 * measure. (We reassess this condition for the next batch of
1841 * datapath flows, so we will recover before all the flows are
1843 n_dp_flows = udpif_get_n_flows(udpif);
1844 kill_them_all = n_dp_flows > flow_limit * 2;
1845 max_idle = n_dp_flows > flow_limit ? 100 : ofproto_max_idle;
1847 for (f = flows; f < &flows[n_dumped]; f++) {
1848 long long int used = f->stats.used;
1849 struct udpif_key *ukey;
1850 bool already_dumped, keep;
1853 if (ukey_acquire(udpif, f, &ukey, &error)) {
1854 if (error == EBUSY) {
1855 /* Another thread is processing this flow, so don't bother
1857 COVERAGE_INC(upcall_ukey_contention);
1859 log_unexpected_flow(f, error);
1860 if (error != ENOENT) {
1861 delete_op_init__(&ops[n_ops++], f);
1867 already_dumped = ukey->dump_seq == dump_seq;
1868 if (already_dumped) {
1869 /* The flow has already been handled during this flow dump
1870 * operation. Skip it. */
1872 COVERAGE_INC(dumped_duplicate_flow);
1874 COVERAGE_INC(dumped_new_flow);
1876 ovs_mutex_unlock(&ukey->mutex);
1881 used = ukey->created;
1883 if (kill_them_all || (used && used < now - max_idle)) {
1886 keep = revalidate_ukey(udpif, ukey, &f->stats, reval_seq);
1888 ukey->dump_seq = dump_seq;
1889 ukey->flow_exists = keep;
1892 delete_op_init(&ops[n_ops++], ukey);
1894 ovs_mutex_unlock(&ukey->mutex);
1898 push_ukey_ops__(udpif, ops, n_ops);
1902 dpif_flow_dump_thread_destroy(dump_thread);
1906 handle_missed_revalidation(struct udpif *udpif, uint64_t reval_seq,
1907 struct udpif_key *ukey)
1909 struct dpif_flow_stats stats;
1912 COVERAGE_INC(revalidate_missed_dp_flow);
1914 memset(&stats, 0, sizeof stats);
1915 ovs_mutex_lock(&ukey->mutex);
1916 keep = revalidate_ukey(udpif, ukey, &stats, reval_seq);
1917 ovs_mutex_unlock(&ukey->mutex);
1923 revalidator_sweep__(struct revalidator *revalidator, bool purge)
1925 struct udpif *udpif;
1926 uint64_t dump_seq, reval_seq;
1929 udpif = revalidator->udpif;
1930 dump_seq = seq_read(udpif->dump_seq);
1931 reval_seq = seq_read(udpif->reval_seq);
1932 slice = revalidator - udpif->revalidators;
1933 ovs_assert(slice < udpif->n_revalidators);
1935 for (int i = slice; i < N_UMAPS; i += udpif->n_revalidators) {
1936 struct ukey_op ops[REVALIDATE_MAX_BATCH];
1937 struct udpif_key *ukey;
1938 struct umap *umap = &udpif->ukeys[i];
1941 CMAP_FOR_EACH(ukey, cmap_node, &umap->cmap) {
1942 bool flow_exists, seq_mismatch;
1944 /* Handler threads could be holding a ukey lock while it installs a
1945 * new flow, so don't hang around waiting for access to it. */
1946 if (ovs_mutex_trylock(&ukey->mutex)) {
1949 flow_exists = ukey->flow_exists;
1950 seq_mismatch = (ukey->dump_seq != dump_seq
1951 && ukey->reval_seq != reval_seq);
1952 ovs_mutex_unlock(&ukey->mutex);
1957 && !handle_missed_revalidation(udpif, reval_seq,
1959 struct ukey_op *op = &ops[n_ops++];
1961 delete_op_init(op, ukey);
1962 if (n_ops == REVALIDATE_MAX_BATCH) {
1963 push_ukey_ops(udpif, umap, ops, n_ops);
1966 } else if (!flow_exists) {
1967 ovs_mutex_lock(&umap->mutex);
1968 ukey_delete(umap, ukey);
1969 ovs_mutex_unlock(&umap->mutex);
1974 push_ukey_ops(udpif, umap, ops, n_ops);
1981 revalidator_sweep(struct revalidator *revalidator)
1983 revalidator_sweep__(revalidator, false);
1987 revalidator_purge(struct revalidator *revalidator)
1989 revalidator_sweep__(revalidator, true);
1993 upcall_unixctl_show(struct unixctl_conn *conn, int argc OVS_UNUSED,
1994 const char *argv[] OVS_UNUSED, void *aux OVS_UNUSED)
1996 struct ds ds = DS_EMPTY_INITIALIZER;
1997 struct udpif *udpif;
1999 LIST_FOR_EACH (udpif, list_node, &all_udpifs) {
2000 unsigned int flow_limit;
2004 atomic_read_relaxed(&udpif->flow_limit, &flow_limit);
2005 atomic_read_relaxed(&udpif->enable_ufid, &ufid_enabled);
2007 ds_put_format(&ds, "%s:\n", dpif_name(udpif->dpif));
2008 ds_put_format(&ds, "\tflows : (current %lu)"
2009 " (avg %u) (max %u) (limit %u)\n", udpif_get_n_flows(udpif),
2010 udpif->avg_n_flows, udpif->max_n_flows, flow_limit);
2011 ds_put_format(&ds, "\tdump duration : %lldms\n", udpif->dump_duration);
2012 ds_put_format(&ds, "\tufid enabled : ");
2014 ds_put_format(&ds, "true\n");
2016 ds_put_format(&ds, "false\n");
2018 ds_put_char(&ds, '\n');
2020 for (i = 0; i < n_revalidators; i++) {
2021 struct revalidator *revalidator = &udpif->revalidators[i];
2022 int j, elements = 0;
2024 for (j = i; j < N_UMAPS; j += n_revalidators) {
2025 elements += cmap_count(&udpif->ukeys[j].cmap);
2027 ds_put_format(&ds, "\t%u: (keys %d)\n", revalidator->id, elements);
2031 unixctl_command_reply(conn, ds_cstr(&ds));
2035 /* Disable using the megaflows.
2037 * This command is only needed for advanced debugging, so it's not
2038 * documented in the man page. */
2040 upcall_unixctl_disable_megaflows(struct unixctl_conn *conn,
2041 int argc OVS_UNUSED,
2042 const char *argv[] OVS_UNUSED,
2043 void *aux OVS_UNUSED)
2045 atomic_store_relaxed(&enable_megaflows, false);
2046 udpif_flush_all_datapaths();
2047 unixctl_command_reply(conn, "megaflows disabled");
2050 /* Re-enable using megaflows.
2052 * This command is only needed for advanced debugging, so it's not
2053 * documented in the man page. */
2055 upcall_unixctl_enable_megaflows(struct unixctl_conn *conn,
2056 int argc OVS_UNUSED,
2057 const char *argv[] OVS_UNUSED,
2058 void *aux OVS_UNUSED)
2060 atomic_store_relaxed(&enable_megaflows, true);
2061 udpif_flush_all_datapaths();
2062 unixctl_command_reply(conn, "megaflows enabled");
2065 /* Disable skipping flow attributes during flow dump.
2067 * This command is only needed for advanced debugging, so it's not
2068 * documented in the man page. */
2070 upcall_unixctl_disable_ufid(struct unixctl_conn *conn, int argc OVS_UNUSED,
2071 const char *argv[] OVS_UNUSED, void *aux OVS_UNUSED)
2073 struct udpif *udpif;
2075 LIST_FOR_EACH (udpif, list_node, &all_udpifs) {
2076 atomic_store(&udpif->enable_ufid, false);
2078 unixctl_command_reply(conn, "Datapath dumping tersely using UFID disabled");
2081 /* Re-enable skipping flow attributes during flow dump.
2083 * This command is only needed for advanced debugging, so it's not documented
2084 * in the man page. */
2086 upcall_unixctl_enable_ufid(struct unixctl_conn *conn, int argc OVS_UNUSED,
2087 const char *argv[] OVS_UNUSED, void *aux OVS_UNUSED)
2089 struct udpif *udpif;
2091 LIST_FOR_EACH (udpif, list_node, &all_udpifs) {
2092 atomic_store(&udpif->enable_ufid, true);
2094 unixctl_command_reply(conn, "Datapath dumping tersely using UFID enabled");
2097 /* Set the flow limit.
2099 * This command is only needed for advanced debugging, so it's not
2100 * documented in the man page. */
2102 upcall_unixctl_set_flow_limit(struct unixctl_conn *conn,
2103 int argc OVS_UNUSED,
2104 const char *argv[] OVS_UNUSED,
2105 void *aux OVS_UNUSED)
2107 struct ds ds = DS_EMPTY_INITIALIZER;
2108 struct udpif *udpif;
2109 unsigned int flow_limit = atoi(argv[1]);
2111 LIST_FOR_EACH (udpif, list_node, &all_udpifs) {
2112 atomic_store_relaxed(&udpif->flow_limit, flow_limit);
2114 ds_put_format(&ds, "set flow_limit to %u\n", flow_limit);
2115 unixctl_command_reply(conn, ds_cstr(&ds));
2120 upcall_unixctl_dump_wait(struct unixctl_conn *conn,
2121 int argc OVS_UNUSED,
2122 const char *argv[] OVS_UNUSED,
2123 void *aux OVS_UNUSED)
2125 if (list_is_singleton(&all_udpifs)) {
2126 struct udpif *udpif = NULL;
2129 udpif = OBJECT_CONTAINING(list_front(&all_udpifs), udpif, list_node);
2130 len = (udpif->n_conns + 1) * sizeof *udpif->conns;
2131 udpif->conn_seq = seq_read(udpif->dump_seq);
2132 udpif->conns = xrealloc(udpif->conns, len);
2133 udpif->conns[udpif->n_conns++] = conn;
2135 unixctl_command_reply_error(conn, "can't wait on multiple udpifs.");
2140 upcall_unixctl_purge(struct unixctl_conn *conn, int argc OVS_UNUSED,
2141 const char *argv[] OVS_UNUSED, void *aux OVS_UNUSED)
2143 struct udpif *udpif;
2145 LIST_FOR_EACH (udpif, list_node, &all_udpifs) {
2148 for (n = 0; n < udpif->n_revalidators; n++) {
2149 revalidator_purge(&udpif->revalidators[n]);
2152 unixctl_command_reply(conn, "");