2 * Copyright (c) 2009, 2010, 2011, 2012, 2013 Nicira, Inc.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at:
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
19 #include "ofproto/ofproto-dpif.h"
20 #include "ofproto/ofproto-provider.h"
27 #include "byte-order.h"
32 #include "dynamic-string.h"
33 #include "fail-open.h"
37 #include "mac-learning.h"
38 #include "meta-flow.h"
39 #include "multipath.h"
40 #include "netdev-vport.h"
45 #include "odp-execute.h"
48 #include "ofp-actions.h"
49 #include "ofp-parse.h"
50 #include "ofp-print.h"
51 #include "ofproto-dpif-governor.h"
52 #include "ofproto-dpif-ipfix.h"
53 #include "ofproto-dpif-sflow.h"
54 #include "ofproto-dpif-xlate.h"
55 #include "poll-loop.h"
60 #include "unaligned.h"
62 #include "vlan-bitmap.h"
65 VLOG_DEFINE_THIS_MODULE(ofproto_dpif);
67 COVERAGE_DEFINE(ofproto_dpif_expired);
68 COVERAGE_DEFINE(facet_changed_rule);
69 COVERAGE_DEFINE(facet_revalidate);
70 COVERAGE_DEFINE(facet_unexpected);
71 COVERAGE_DEFINE(facet_suppress);
72 COVERAGE_DEFINE(subfacet_install_fail);
77 static struct rule_dpif *rule_dpif_lookup(struct ofproto_dpif *,
79 struct flow_wildcards *wc);
81 static void rule_get_stats(struct rule *, uint64_t *packets, uint64_t *bytes);
82 static void rule_invalidate(const struct rule_dpif *);
84 static void mirror_destroy(struct ofmirror *);
85 static void update_mirror_stats(struct ofproto_dpif *ofproto,
86 mirror_mask_t mirrors,
87 uint64_t packets, uint64_t bytes);
89 static void bundle_remove(struct ofport *);
90 static void bundle_update(struct ofbundle *);
91 static void bundle_destroy(struct ofbundle *);
92 static void bundle_del_port(struct ofport_dpif *);
93 static void bundle_run(struct ofbundle *);
94 static void bundle_wait(struct ofbundle *);
96 static void stp_run(struct ofproto_dpif *ofproto);
97 static void stp_wait(struct ofproto_dpif *ofproto);
98 static int set_stp_port(struct ofport *,
99 const struct ofproto_port_stp_settings *);
101 static void compose_slow_path(const struct ofproto_dpif *, const struct flow *,
102 enum slow_path_reason,
103 uint64_t *stub, size_t stub_size,
104 const struct nlattr **actionsp,
105 size_t *actions_lenp);
107 /* A subfacet (see "struct subfacet" below) has three possible installation
110 * - SF_NOT_INSTALLED: Not installed in the datapath. This will only be the
111 * case just after the subfacet is created, just before the subfacet is
112 * destroyed, or if the datapath returns an error when we try to install a
115 * - SF_FAST_PATH: The subfacet's actions are installed in the datapath.
117 * - SF_SLOW_PATH: An action that sends every packet for the subfacet through
118 * ofproto_dpif is installed in the datapath.
121 SF_NOT_INSTALLED, /* No datapath flow for this subfacet. */
122 SF_FAST_PATH, /* Full actions are installed. */
123 SF_SLOW_PATH, /* Send-to-userspace action is installed. */
126 /* A dpif flow and actions associated with a facet.
128 * See also the large comment on struct facet. */
131 struct hmap_node hmap_node; /* In struct ofproto_dpif 'subfacets' list. */
132 struct list list_node; /* In struct facet's 'facets' list. */
133 struct facet *facet; /* Owning facet. */
134 struct dpif_backer *backer; /* Owning backer. */
136 enum odp_key_fitness key_fitness;
140 long long int used; /* Time last used; time created if not used. */
141 long long int created; /* Time created. */
143 uint64_t dp_packet_count; /* Last known packet count in the datapath. */
144 uint64_t dp_byte_count; /* Last known byte count in the datapath. */
146 enum subfacet_path path; /* Installed in datapath? */
149 #define SUBFACET_DESTROY_MAX_BATCH 50
151 static struct subfacet *subfacet_create(struct facet *, struct flow_miss *miss,
153 static struct subfacet *subfacet_find(struct dpif_backer *,
154 const struct nlattr *key, size_t key_len,
156 static void subfacet_destroy(struct subfacet *);
157 static void subfacet_destroy__(struct subfacet *);
158 static void subfacet_destroy_batch(struct dpif_backer *,
159 struct subfacet **, int n);
160 static void subfacet_reset_dp_stats(struct subfacet *,
161 struct dpif_flow_stats *);
162 static void subfacet_update_stats(struct subfacet *,
163 const struct dpif_flow_stats *);
164 static int subfacet_install(struct subfacet *,
165 const struct ofpbuf *odp_actions,
166 struct dpif_flow_stats *);
167 static void subfacet_uninstall(struct subfacet *);
169 /* A unique, non-overlapping instantiation of an OpenFlow flow.
171 * A facet associates a "struct flow", which represents the Open vSwitch
172 * userspace idea of an exact-match flow, with one or more subfacets.
173 * While the facet is created based on an exact-match flow, it is stored
174 * within the ofproto based on the wildcards that could be expressed
175 * based on the flow table and other configuration. (See the 'wc'
176 * description in "struct xlate_out" for more details.)
178 * Each subfacet tracks the datapath's idea of the flow equivalent to
179 * the facet. When the kernel module (or other dpif implementation) and
180 * Open vSwitch userspace agree on the definition of a flow key, there
181 * is exactly one subfacet per facet. If the dpif implementation
182 * supports more-specific flow matching than userspace, however, a facet
183 * can have more than one subfacet. Examples include the dpif
184 * implementation not supporting the same wildcards as userspace or some
185 * distinction in flow that userspace simply doesn't understand.
187 * Flow expiration works in terms of subfacets, so a facet must have at
188 * least one subfacet or it will never expire, leaking memory. */
191 struct hmap_node hmap_node; /* In owning ofproto's 'facets' hmap. */
192 struct list list_node; /* In owning rule's 'facets' list. */
193 struct rule_dpif *rule; /* Owning rule. */
196 struct list subfacets;
197 long long int used; /* Time last used; time created if not used. */
200 struct flow flow; /* Flow of the creating subfacet. */
201 struct cls_rule cr; /* In 'ofproto_dpif's facets classifier. */
205 * - Do include packets and bytes sent "by hand", e.g. with
208 * - Do include packets and bytes that were obtained from the datapath
209 * when a subfacet's statistics were reset (e.g. dpif_flow_put() with
210 * DPIF_FP_ZERO_STATS).
212 * - Do not include packets or bytes that can be obtained from the
213 * datapath for any existing subfacet.
215 uint64_t packet_count; /* Number of packets received. */
216 uint64_t byte_count; /* Number of bytes received. */
218 /* Resubmit statistics. */
219 uint64_t prev_packet_count; /* Number of packets from last stats push. */
220 uint64_t prev_byte_count; /* Number of bytes from last stats push. */
221 long long int prev_used; /* Used time from last stats push. */
224 uint64_t accounted_bytes; /* Bytes processed by facet_account(). */
225 struct netflow_flow nf_flow; /* Per-flow NetFlow tracking data. */
226 uint8_t tcp_flags; /* TCP flags seen for this 'rule'. */
228 struct xlate_out xout;
230 /* Storage for a single subfacet, to reduce malloc() time and space
231 * overhead. (A facet always has at least one subfacet and in the common
232 * case has exactly one subfacet. However, 'one_subfacet' may not
233 * always be valid, since it could have been removed after newer
234 * subfacets were pushed onto the 'subfacets' list.) */
235 struct subfacet one_subfacet;
237 long long int learn_rl; /* Rate limiter for facet_learn(). */
240 static struct facet *facet_create(const struct flow_miss *, struct rule_dpif *,
242 struct dpif_flow_stats *);
243 static void facet_remove(struct facet *);
244 static void facet_free(struct facet *);
246 static struct facet *facet_find(struct ofproto_dpif *, const struct flow *);
247 static struct facet *facet_lookup_valid(struct ofproto_dpif *,
248 const struct flow *);
249 static bool facet_revalidate(struct facet *);
250 static bool facet_check_consistency(struct facet *);
252 static void facet_flush_stats(struct facet *);
254 static void facet_reset_counters(struct facet *);
255 static void facet_push_stats(struct facet *, bool may_learn);
256 static void facet_learn(struct facet *);
257 static void facet_account(struct facet *);
258 static void push_all_stats(void);
260 static bool facet_is_controller_flow(struct facet *);
262 /* Node in 'ofport_dpif''s 'priorities' map. Used to maintain a map from
263 * 'priority' (the datapath's term for QoS queue) to the dscp bits which all
264 * traffic egressing the 'ofport' with that priority should be marked with. */
265 struct priority_to_dscp {
266 struct hmap_node hmap_node; /* Node in 'ofport_dpif''s 'priorities' map. */
267 uint32_t priority; /* Priority of this queue (see struct flow). */
269 uint8_t dscp; /* DSCP bits to mark outgoing traffic with. */
272 /* Linux VLAN device support (e.g. "eth0.10" for VLAN 10.)
274 * This is deprecated. It is only for compatibility with broken device drivers
275 * in old versions of Linux that do not properly support VLANs when VLAN
276 * devices are not used. When broken device drivers are no longer in
277 * widespread use, we will delete these interfaces. */
278 struct vlan_splinter {
279 struct hmap_node realdev_vid_node;
280 struct hmap_node vlandev_node;
281 ofp_port_t realdev_ofp_port;
282 ofp_port_t vlandev_ofp_port;
286 static bool vsp_adjust_flow(const struct ofproto_dpif *, struct flow *);
287 static void vsp_remove(struct ofport_dpif *);
288 static void vsp_add(struct ofport_dpif *, ofp_port_t realdev_ofp_port, int vid);
290 static ofp_port_t odp_port_to_ofp_port(const struct ofproto_dpif *,
291 odp_port_t odp_port);
293 static struct ofport_dpif *
294 ofport_dpif_cast(const struct ofport *ofport)
296 return ofport ? CONTAINER_OF(ofport, struct ofport_dpif, up) : NULL;
299 static void port_run(struct ofport_dpif *);
300 static void port_run_fast(struct ofport_dpif *);
301 static void port_wait(struct ofport_dpif *);
302 static int set_bfd(struct ofport *, const struct smap *);
303 static int set_cfm(struct ofport *, const struct cfm_settings *);
304 static void ofport_clear_priorities(struct ofport_dpif *);
305 static void ofport_update_peer(struct ofport_dpif *);
306 static void run_fast_rl(void);
308 struct dpif_completion {
309 struct list list_node;
310 struct ofoperation *op;
313 /* Reasons that we might need to revalidate every facet, and corresponding
316 * A value of 0 means that there is no need to revalidate.
318 * It would be nice to have some cleaner way to integrate with coverage
319 * counters, but with only a few reasons I guess this is good enough for
321 enum revalidate_reason {
322 REV_RECONFIGURE = 1, /* Switch configuration changed. */
323 REV_STP, /* Spanning tree protocol port status change. */
324 REV_PORT_TOGGLED, /* Port enabled or disabled by CFM, LACP, ...*/
325 REV_FLOW_TABLE, /* Flow table changed. */
326 REV_INCONSISTENCY /* Facet self-check failed. */
328 COVERAGE_DEFINE(rev_reconfigure);
329 COVERAGE_DEFINE(rev_stp);
330 COVERAGE_DEFINE(rev_port_toggled);
331 COVERAGE_DEFINE(rev_flow_table);
332 COVERAGE_DEFINE(rev_inconsistency);
334 /* Drop keys are odp flow keys which have drop flows installed in the kernel.
335 * These are datapath flows which have no associated ofproto, if they did we
336 * would use facets. */
338 struct hmap_node hmap_node;
343 struct avg_subfacet_rates {
344 double add_rate; /* Moving average of new flows created per minute. */
345 double del_rate; /* Moving average of flows deleted per minute. */
348 /* All datapaths of a given type share a single dpif backer instance. */
353 struct timer next_expiration;
354 struct hmap odp_to_ofport_map; /* ODP port to ofport mapping. */
356 struct simap tnl_backers; /* Set of dpif ports backing tunnels. */
358 /* Facet revalidation flags applying to facets which use this backer. */
359 enum revalidate_reason need_revalidate; /* Revalidate every facet. */
360 struct tag_set revalidate_set; /* Revalidate only matching facets. */
362 struct hmap drop_keys; /* Set of dropped odp keys. */
363 bool recv_set_enable; /* Enables or disables receiving packets. */
365 struct hmap subfacets;
366 struct governor *governor;
368 /* Subfacet statistics.
370 * These keep track of the total number of subfacets added and deleted and
371 * flow life span. They are useful for computing the flow rates stats
372 * exposed via "ovs-appctl dpif/show". The goal is to learn about
373 * traffic patterns in ways that we can use later to improve Open vSwitch
374 * performance in new situations. */
375 long long int created; /* Time when it is created. */
376 unsigned max_n_subfacet; /* Maximum number of flows */
377 unsigned avg_n_subfacet; /* Average number of flows. */
378 long long int avg_subfacet_life; /* Average life span of subfacets. */
380 /* The average number of subfacets... */
381 struct avg_subfacet_rates hourly; /* ...over the last hour. */
382 struct avg_subfacet_rates daily; /* ...over the last day. */
383 struct avg_subfacet_rates lifetime; /* ...over the switch lifetime. */
384 long long int last_minute; /* Last time 'hourly' was updated. */
386 /* Number of subfacets added or deleted since 'last_minute'. */
387 unsigned subfacet_add_count;
388 unsigned subfacet_del_count;
390 /* Number of subfacets added or deleted from 'created' to 'last_minute.' */
391 unsigned long long int total_subfacet_add_count;
392 unsigned long long int total_subfacet_del_count;
395 /* All existing ofproto_backer instances, indexed by ofproto->up.type. */
396 static struct shash all_dpif_backers = SHASH_INITIALIZER(&all_dpif_backers);
398 static void drop_key_clear(struct dpif_backer *);
399 static struct ofport_dpif *
400 odp_port_to_ofport(const struct dpif_backer *, odp_port_t odp_port);
401 static void update_moving_averages(struct dpif_backer *backer);
403 /* Defer flow mod completion until "ovs-appctl ofproto/unclog"? (Useful only
404 * for debugging the asynchronous flow_mod implementation.) */
407 /* All existing ofproto_dpif instances, indexed by ->up.name. */
408 static struct hmap all_ofproto_dpifs = HMAP_INITIALIZER(&all_ofproto_dpifs);
410 static void ofproto_dpif_unixctl_init(void);
413 #define FLOW_MISS_MAX_BATCH 50
414 static int handle_upcalls(struct dpif_backer *, unsigned int max_batch);
416 /* Flow expiration. */
417 static int expire(struct dpif_backer *);
420 static void send_netflow_active_timeouts(struct ofproto_dpif *);
423 static int send_packet(const struct ofport_dpif *, struct ofpbuf *packet);
425 /* Global variables. */
426 static struct vlog_rate_limit rl = VLOG_RATE_LIMIT_INIT(1, 5);
428 /* Initial mappings of port to bridge mappings. */
429 static struct shash init_ofp_ports = SHASH_INITIALIZER(&init_ofp_ports);
431 /* Factory functions. */
434 init(const struct shash *iface_hints)
436 struct shash_node *node;
438 /* Make a local copy, since we don't own 'iface_hints' elements. */
439 SHASH_FOR_EACH(node, iface_hints) {
440 const struct iface_hint *orig_hint = node->data;
441 struct iface_hint *new_hint = xmalloc(sizeof *new_hint);
443 new_hint->br_name = xstrdup(orig_hint->br_name);
444 new_hint->br_type = xstrdup(orig_hint->br_type);
445 new_hint->ofp_port = orig_hint->ofp_port;
447 shash_add(&init_ofp_ports, node->name, new_hint);
452 enumerate_types(struct sset *types)
454 dp_enumerate_types(types);
458 enumerate_names(const char *type, struct sset *names)
460 struct ofproto_dpif *ofproto;
463 HMAP_FOR_EACH (ofproto, all_ofproto_dpifs_node, &all_ofproto_dpifs) {
464 if (strcmp(type, ofproto->up.type)) {
467 sset_add(names, ofproto->up.name);
474 del(const char *type, const char *name)
479 error = dpif_open(name, type, &dpif);
481 error = dpif_delete(dpif);
488 port_open_type(const char *datapath_type, const char *port_type)
490 return dpif_port_open_type(datapath_type, port_type);
493 /* Type functions. */
495 static struct ofproto_dpif *
496 lookup_ofproto_dpif_by_port_name(const char *name)
498 struct ofproto_dpif *ofproto;
500 HMAP_FOR_EACH (ofproto, all_ofproto_dpifs_node, &all_ofproto_dpifs) {
501 if (sset_contains(&ofproto->ports, name)) {
510 type_run(const char *type)
512 static long long int push_timer = LLONG_MIN;
513 struct dpif_backer *backer;
517 backer = shash_find_data(&all_dpif_backers, type);
519 /* This is not necessarily a problem, since backers are only
520 * created on demand. */
524 dpif_run(backer->dpif);
526 /* The most natural place to push facet statistics is when they're pulled
527 * from the datapath. However, when there are many flows in the datapath,
528 * this expensive operation can occur so frequently, that it reduces our
529 * ability to quickly set up flows. To reduce the cost, we push statistics
531 if (time_msec() > push_timer) {
532 push_timer = time_msec() + 2000;
536 /* If vswitchd started with other_config:flow_restore_wait set as "true",
537 * and the configuration has now changed to "false", enable receiving
538 * packets from the datapath. */
539 if (!backer->recv_set_enable && !ofproto_get_flow_restore_wait()) {
540 backer->recv_set_enable = true;
542 error = dpif_recv_set(backer->dpif, backer->recv_set_enable);
544 VLOG_ERR("Failed to enable receiving packets in dpif.");
547 dpif_flow_flush(backer->dpif);
548 backer->need_revalidate = REV_RECONFIGURE;
551 if (backer->need_revalidate
552 || !tag_set_is_empty(&backer->revalidate_set)) {
553 struct tag_set revalidate_set = backer->revalidate_set;
554 bool need_revalidate = backer->need_revalidate;
555 struct ofproto_dpif *ofproto;
556 struct simap_node *node;
557 struct simap tmp_backers;
559 /* Handle tunnel garbage collection. */
560 simap_init(&tmp_backers);
561 simap_swap(&backer->tnl_backers, &tmp_backers);
563 HMAP_FOR_EACH (ofproto, all_ofproto_dpifs_node, &all_ofproto_dpifs) {
564 struct ofport_dpif *iter;
566 if (backer != ofproto->backer) {
570 HMAP_FOR_EACH (iter, up.hmap_node, &ofproto->up.ports) {
571 char namebuf[NETDEV_VPORT_NAME_BUFSIZE];
574 if (!iter->tnl_port) {
578 dp_port = netdev_vport_get_dpif_port(iter->up.netdev,
579 namebuf, sizeof namebuf);
580 node = simap_find(&tmp_backers, dp_port);
582 simap_put(&backer->tnl_backers, dp_port, node->data);
583 simap_delete(&tmp_backers, node);
584 node = simap_find(&backer->tnl_backers, dp_port);
586 node = simap_find(&backer->tnl_backers, dp_port);
588 odp_port_t odp_port = ODPP_NONE;
590 if (!dpif_port_add(backer->dpif, iter->up.netdev,
592 simap_put(&backer->tnl_backers, dp_port,
593 odp_to_u32(odp_port));
594 node = simap_find(&backer->tnl_backers, dp_port);
599 iter->odp_port = node ? u32_to_odp(node->data) : ODPP_NONE;
600 if (tnl_port_reconfigure(&iter->up, iter->odp_port,
602 backer->need_revalidate = REV_RECONFIGURE;
607 SIMAP_FOR_EACH (node, &tmp_backers) {
608 dpif_port_del(backer->dpif, u32_to_odp(node->data));
610 simap_destroy(&tmp_backers);
612 switch (backer->need_revalidate) {
613 case REV_RECONFIGURE: COVERAGE_INC(rev_reconfigure); break;
614 case REV_STP: COVERAGE_INC(rev_stp); break;
615 case REV_PORT_TOGGLED: COVERAGE_INC(rev_port_toggled); break;
616 case REV_FLOW_TABLE: COVERAGE_INC(rev_flow_table); break;
617 case REV_INCONSISTENCY: COVERAGE_INC(rev_inconsistency); break;
620 if (backer->need_revalidate) {
621 /* Clear the drop_keys in case we should now be accepting some
622 * formerly dropped flows. */
623 drop_key_clear(backer);
626 /* Clear the revalidation flags. */
627 tag_set_init(&backer->revalidate_set);
628 backer->need_revalidate = 0;
630 HMAP_FOR_EACH (ofproto, all_ofproto_dpifs_node, &all_ofproto_dpifs) {
631 struct facet *facet, *next;
632 struct cls_cursor cursor;
634 if (ofproto->backer != backer) {
638 cls_cursor_init(&cursor, &ofproto->facets, NULL);
639 CLS_CURSOR_FOR_EACH_SAFE (facet, next, cr, &cursor) {
641 || tag_set_intersects(&revalidate_set, facet->xout.tags)) {
642 facet_revalidate(facet);
649 if (!backer->recv_set_enable) {
650 /* Wake up before a max of 1000ms. */
651 timer_set_duration(&backer->next_expiration, 1000);
652 } else if (timer_expired(&backer->next_expiration)) {
653 int delay = expire(backer);
654 timer_set_duration(&backer->next_expiration, delay);
657 /* Check for port changes in the dpif. */
658 while ((error = dpif_port_poll(backer->dpif, &devname)) == 0) {
659 struct ofproto_dpif *ofproto;
660 struct dpif_port port;
662 /* Don't report on the datapath's device. */
663 if (!strcmp(devname, dpif_base_name(backer->dpif))) {
667 HMAP_FOR_EACH (ofproto, all_ofproto_dpifs_node,
668 &all_ofproto_dpifs) {
669 if (simap_contains(&ofproto->backer->tnl_backers, devname)) {
674 ofproto = lookup_ofproto_dpif_by_port_name(devname);
675 if (dpif_port_query_by_name(backer->dpif, devname, &port)) {
676 /* The port was removed. If we know the datapath,
677 * report it through poll_set(). If we don't, it may be
678 * notifying us of a removal we initiated, so ignore it.
679 * If there's a pending ENOBUFS, let it stand, since
680 * everything will be reevaluated. */
681 if (ofproto && ofproto->port_poll_errno != ENOBUFS) {
682 sset_add(&ofproto->port_poll_set, devname);
683 ofproto->port_poll_errno = 0;
685 } else if (!ofproto) {
686 /* The port was added, but we don't know with which
687 * ofproto we should associate it. Delete it. */
688 dpif_port_del(backer->dpif, port.port_no);
690 dpif_port_destroy(&port);
696 if (error != EAGAIN) {
697 struct ofproto_dpif *ofproto;
699 /* There was some sort of error, so propagate it to all
700 * ofprotos that use this backer. */
701 HMAP_FOR_EACH (ofproto, all_ofproto_dpifs_node,
702 &all_ofproto_dpifs) {
703 if (ofproto->backer == backer) {
704 sset_clear(&ofproto->port_poll_set);
705 ofproto->port_poll_errno = error;
710 if (backer->governor) {
713 governor_run(backer->governor);
715 /* If the governor has shrunk to its minimum size and the number of
716 * subfacets has dwindled, then drop the governor entirely.
718 * For hysteresis, the number of subfacets to drop the governor is
719 * smaller than the number needed to trigger its creation. */
720 n_subfacets = hmap_count(&backer->subfacets);
721 if (n_subfacets * 4 < flow_eviction_threshold
722 && governor_is_idle(backer->governor)) {
723 governor_destroy(backer->governor);
724 backer->governor = NULL;
732 dpif_backer_run_fast(struct dpif_backer *backer, int max_batch)
736 /* If recv_set_enable is false, we should not handle upcalls. */
737 if (!backer->recv_set_enable) {
741 /* Handle one or more batches of upcalls, until there's nothing left to do
742 * or until we do a fixed total amount of work.
744 * We do work in batches because it can be much cheaper to set up a number
745 * of flows and fire off their patches all at once. We do multiple batches
746 * because in some cases handling a packet can cause another packet to be
747 * queued almost immediately as part of the return flow. Both
748 * optimizations can make major improvements on some benchmarks and
749 * presumably for real traffic as well. */
751 while (work < max_batch) {
752 int retval = handle_upcalls(backer, max_batch - work);
763 type_run_fast(const char *type)
765 struct dpif_backer *backer;
767 backer = shash_find_data(&all_dpif_backers, type);
769 /* This is not necessarily a problem, since backers are only
770 * created on demand. */
774 return dpif_backer_run_fast(backer, FLOW_MISS_MAX_BATCH);
780 static long long int port_rl = LLONG_MIN;
781 static unsigned int backer_rl = 0;
783 if (time_msec() >= port_rl) {
784 struct ofproto_dpif *ofproto;
785 struct ofport_dpif *ofport;
787 HMAP_FOR_EACH (ofproto, all_ofproto_dpifs_node, &all_ofproto_dpifs) {
789 HMAP_FOR_EACH (ofport, up.hmap_node, &ofproto->up.ports) {
790 port_run_fast(ofport);
793 port_rl = time_msec() + 200;
796 /* XXX: We have to be careful not to do too much work in this function. If
797 * we call dpif_backer_run_fast() too often, or with too large a batch,
798 * performance improves signifcantly, but at a cost. It's possible for the
799 * number of flows in the datapath to increase without bound, and for poll
800 * loops to take 10s of seconds. The correct solution to this problem,
801 * long term, is to separate flow miss handling into it's own thread so it
802 * isn't affected by revalidations, and expirations. Until then, this is
803 * the best we can do. */
804 if (++backer_rl >= 10) {
805 struct shash_node *node;
808 SHASH_FOR_EACH (node, &all_dpif_backers) {
809 dpif_backer_run_fast(node->data, 1);
815 type_wait(const char *type)
817 struct dpif_backer *backer;
819 backer = shash_find_data(&all_dpif_backers, type);
821 /* This is not necessarily a problem, since backers are only
822 * created on demand. */
826 if (backer->governor) {
827 governor_wait(backer->governor);
830 timer_wait(&backer->next_expiration);
833 /* Basic life-cycle. */
835 static int add_internal_flows(struct ofproto_dpif *);
837 static struct ofproto *
840 struct ofproto_dpif *ofproto = xmalloc(sizeof *ofproto);
845 dealloc(struct ofproto *ofproto_)
847 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
852 close_dpif_backer(struct dpif_backer *backer)
854 struct shash_node *node;
856 ovs_assert(backer->refcount > 0);
858 if (--backer->refcount) {
862 drop_key_clear(backer);
863 hmap_destroy(&backer->drop_keys);
865 simap_destroy(&backer->tnl_backers);
866 hmap_destroy(&backer->odp_to_ofport_map);
867 node = shash_find(&all_dpif_backers, backer->type);
869 shash_delete(&all_dpif_backers, node);
870 dpif_close(backer->dpif);
872 ovs_assert(hmap_is_empty(&backer->subfacets));
873 hmap_destroy(&backer->subfacets);
874 governor_destroy(backer->governor);
879 /* Datapath port slated for removal from datapath. */
881 struct list list_node;
886 open_dpif_backer(const char *type, struct dpif_backer **backerp)
888 struct dpif_backer *backer;
889 struct dpif_port_dump port_dump;
890 struct dpif_port port;
891 struct shash_node *node;
892 struct list garbage_list;
893 struct odp_garbage *garbage, *next;
899 backer = shash_find_data(&all_dpif_backers, type);
906 backer_name = xasprintf("ovs-%s", type);
908 /* Remove any existing datapaths, since we assume we're the only
909 * userspace controlling the datapath. */
911 dp_enumerate_names(type, &names);
912 SSET_FOR_EACH(name, &names) {
913 struct dpif *old_dpif;
915 /* Don't remove our backer if it exists. */
916 if (!strcmp(name, backer_name)) {
920 if (dpif_open(name, type, &old_dpif)) {
921 VLOG_WARN("couldn't open old datapath %s to remove it", name);
923 dpif_delete(old_dpif);
924 dpif_close(old_dpif);
927 sset_destroy(&names);
929 backer = xmalloc(sizeof *backer);
931 error = dpif_create_and_open(backer_name, type, &backer->dpif);
934 VLOG_ERR("failed to open datapath of type %s: %s", type,
940 backer->type = xstrdup(type);
941 backer->governor = NULL;
942 backer->refcount = 1;
943 hmap_init(&backer->odp_to_ofport_map);
944 hmap_init(&backer->drop_keys);
945 hmap_init(&backer->subfacets);
946 timer_set_duration(&backer->next_expiration, 1000);
947 backer->need_revalidate = 0;
948 simap_init(&backer->tnl_backers);
949 tag_set_init(&backer->revalidate_set);
950 backer->recv_set_enable = !ofproto_get_flow_restore_wait();
953 if (backer->recv_set_enable) {
954 dpif_flow_flush(backer->dpif);
957 /* Loop through the ports already on the datapath and remove any
958 * that we don't need anymore. */
959 list_init(&garbage_list);
960 dpif_port_dump_start(&port_dump, backer->dpif);
961 while (dpif_port_dump_next(&port_dump, &port)) {
962 node = shash_find(&init_ofp_ports, port.name);
963 if (!node && strcmp(port.name, dpif_base_name(backer->dpif))) {
964 garbage = xmalloc(sizeof *garbage);
965 garbage->odp_port = port.port_no;
966 list_push_front(&garbage_list, &garbage->list_node);
969 dpif_port_dump_done(&port_dump);
971 LIST_FOR_EACH_SAFE (garbage, next, list_node, &garbage_list) {
972 dpif_port_del(backer->dpif, garbage->odp_port);
973 list_remove(&garbage->list_node);
977 shash_add(&all_dpif_backers, type, backer);
979 error = dpif_recv_set(backer->dpif, backer->recv_set_enable);
981 VLOG_ERR("failed to listen on datapath of type %s: %s",
982 type, strerror(error));
983 close_dpif_backer(backer);
987 backer->max_n_subfacet = 0;
988 backer->created = time_msec();
989 backer->last_minute = backer->created;
990 memset(&backer->hourly, 0, sizeof backer->hourly);
991 memset(&backer->daily, 0, sizeof backer->daily);
992 memset(&backer->lifetime, 0, sizeof backer->lifetime);
993 backer->subfacet_add_count = 0;
994 backer->subfacet_del_count = 0;
995 backer->total_subfacet_add_count = 0;
996 backer->total_subfacet_del_count = 0;
997 backer->avg_n_subfacet = 0;
998 backer->avg_subfacet_life = 0;
1004 construct(struct ofproto *ofproto_)
1006 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
1007 struct shash_node *node, *next;
1008 odp_port_t max_ports;
1012 error = open_dpif_backer(ofproto->up.type, &ofproto->backer);
1017 max_ports = dpif_get_max_ports(ofproto->backer->dpif);
1018 ofproto_init_max_ports(ofproto_, u16_to_ofp(MIN(odp_to_u32(max_ports),
1019 ofp_to_u16(OFPP_MAX))));
1021 ofproto->netflow = NULL;
1022 ofproto->sflow = NULL;
1023 ofproto->ipfix = NULL;
1024 ofproto->stp = NULL;
1025 hmap_init(&ofproto->bundles);
1026 ofproto->ml = mac_learning_create(MAC_ENTRY_DEFAULT_IDLE_TIME);
1027 for (i = 0; i < MAX_MIRRORS; i++) {
1028 ofproto->mirrors[i] = NULL;
1030 ofproto->has_bonded_bundles = false;
1032 classifier_init(&ofproto->facets);
1033 ofproto->consistency_rl = LLONG_MIN;
1035 for (i = 0; i < N_TABLES; i++) {
1036 struct table_dpif *table = &ofproto->tables[i];
1038 table->catchall_table = NULL;
1039 table->other_table = NULL;
1040 table->basis = random_uint32();
1043 list_init(&ofproto->completions);
1045 ofproto_dpif_unixctl_init();
1047 ofproto->has_mirrors = false;
1048 hmap_init(&ofproto->vlandev_map);
1049 hmap_init(&ofproto->realdev_vid_map);
1051 sset_init(&ofproto->ports);
1052 sset_init(&ofproto->ghost_ports);
1053 sset_init(&ofproto->port_poll_set);
1054 ofproto->port_poll_errno = 0;
1056 SHASH_FOR_EACH_SAFE (node, next, &init_ofp_ports) {
1057 struct iface_hint *iface_hint = node->data;
1059 if (!strcmp(iface_hint->br_name, ofproto->up.name)) {
1060 /* Check if the datapath already has this port. */
1061 if (dpif_port_exists(ofproto->backer->dpif, node->name)) {
1062 sset_add(&ofproto->ports, node->name);
1065 free(iface_hint->br_name);
1066 free(iface_hint->br_type);
1068 shash_delete(&init_ofp_ports, node);
1072 hmap_insert(&all_ofproto_dpifs, &ofproto->all_ofproto_dpifs_node,
1073 hash_string(ofproto->up.name, 0));
1074 memset(&ofproto->stats, 0, sizeof ofproto->stats);
1076 ofproto_init_tables(ofproto_, N_TABLES);
1077 error = add_internal_flows(ofproto);
1078 ofproto->up.tables[TBL_INTERNAL].flags = OFTABLE_HIDDEN | OFTABLE_READONLY;
1081 ofproto->n_missed = 0;
1087 add_internal_flow(struct ofproto_dpif *ofproto, int id,
1088 const struct ofpbuf *ofpacts, struct rule_dpif **rulep)
1090 struct ofputil_flow_mod fm;
1093 match_init_catchall(&fm.match);
1095 match_set_reg(&fm.match, 0, id);
1096 fm.new_cookie = htonll(0);
1097 fm.cookie = htonll(0);
1098 fm.cookie_mask = htonll(0);
1099 fm.table_id = TBL_INTERNAL;
1100 fm.command = OFPFC_ADD;
1101 fm.idle_timeout = 0;
1102 fm.hard_timeout = 0;
1106 fm.ofpacts = ofpacts->data;
1107 fm.ofpacts_len = ofpacts->size;
1109 error = ofproto_flow_mod(&ofproto->up, &fm);
1111 VLOG_ERR_RL(&rl, "failed to add internal flow %d (%s)",
1112 id, ofperr_to_string(error));
1116 *rulep = rule_dpif_lookup_in_table(ofproto, &fm.match.flow, NULL,
1118 ovs_assert(*rulep != NULL);
1124 add_internal_flows(struct ofproto_dpif *ofproto)
1126 struct ofpact_controller *controller;
1127 uint64_t ofpacts_stub[128 / 8];
1128 struct ofpbuf ofpacts;
1132 ofpbuf_use_stack(&ofpacts, ofpacts_stub, sizeof ofpacts_stub);
1135 controller = ofpact_put_CONTROLLER(&ofpacts);
1136 controller->max_len = UINT16_MAX;
1137 controller->controller_id = 0;
1138 controller->reason = OFPR_NO_MATCH;
1139 ofpact_pad(&ofpacts);
1141 error = add_internal_flow(ofproto, id++, &ofpacts, &ofproto->miss_rule);
1146 ofpbuf_clear(&ofpacts);
1147 error = add_internal_flow(ofproto, id++, &ofpacts,
1148 &ofproto->no_packet_in_rule);
1153 error = add_internal_flow(ofproto, id++, &ofpacts,
1154 &ofproto->drop_frags_rule);
1159 complete_operations(struct ofproto_dpif *ofproto)
1161 struct dpif_completion *c, *next;
1163 LIST_FOR_EACH_SAFE (c, next, list_node, &ofproto->completions) {
1164 ofoperation_complete(c->op, 0);
1165 list_remove(&c->list_node);
1171 destruct(struct ofproto *ofproto_)
1173 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
1174 struct rule_dpif *rule, *next_rule;
1175 struct oftable *table;
1178 ofproto->backer->need_revalidate = REV_RECONFIGURE;
1179 hmap_remove(&all_ofproto_dpifs, &ofproto->all_ofproto_dpifs_node);
1180 complete_operations(ofproto);
1182 OFPROTO_FOR_EACH_TABLE (table, &ofproto->up) {
1183 struct cls_cursor cursor;
1185 cls_cursor_init(&cursor, &table->cls, NULL);
1186 CLS_CURSOR_FOR_EACH_SAFE (rule, next_rule, up.cr, &cursor) {
1187 ofproto_rule_destroy(&rule->up);
1191 for (i = 0; i < MAX_MIRRORS; i++) {
1192 mirror_destroy(ofproto->mirrors[i]);
1195 netflow_destroy(ofproto->netflow);
1196 dpif_sflow_unref(ofproto->sflow);
1197 hmap_destroy(&ofproto->bundles);
1198 mac_learning_unref(ofproto->ml);
1200 classifier_destroy(&ofproto->facets);
1202 hmap_destroy(&ofproto->vlandev_map);
1203 hmap_destroy(&ofproto->realdev_vid_map);
1205 sset_destroy(&ofproto->ports);
1206 sset_destroy(&ofproto->ghost_ports);
1207 sset_destroy(&ofproto->port_poll_set);
1209 close_dpif_backer(ofproto->backer);
1213 run_fast(struct ofproto *ofproto_)
1215 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
1216 struct ofport_dpif *ofport;
1218 /* Do not perform any periodic activity required by 'ofproto' while
1219 * waiting for flow restore to complete. */
1220 if (ofproto_get_flow_restore_wait()) {
1224 HMAP_FOR_EACH (ofport, up.hmap_node, &ofproto->up.ports) {
1225 port_run_fast(ofport);
1232 run(struct ofproto *ofproto_)
1234 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
1235 struct ofport_dpif *ofport;
1236 struct ofbundle *bundle;
1240 complete_operations(ofproto);
1243 /* Do not perform any periodic activity below required by 'ofproto' while
1244 * waiting for flow restore to complete. */
1245 if (ofproto_get_flow_restore_wait()) {
1249 error = run_fast(ofproto_);
1254 if (ofproto->netflow) {
1255 if (netflow_run(ofproto->netflow)) {
1256 send_netflow_active_timeouts(ofproto);
1259 if (ofproto->sflow) {
1260 dpif_sflow_run(ofproto->sflow);
1263 HMAP_FOR_EACH (ofport, up.hmap_node, &ofproto->up.ports) {
1266 HMAP_FOR_EACH (bundle, hmap_node, &ofproto->bundles) {
1271 mac_learning_run(ofproto->ml, &ofproto->backer->revalidate_set);
1273 /* Check the consistency of a random facet, to aid debugging. */
1274 if (time_msec() >= ofproto->consistency_rl
1275 && !classifier_is_empty(&ofproto->facets)
1276 && !ofproto->backer->need_revalidate) {
1277 struct cls_table *table;
1278 struct cls_rule *cr;
1279 struct facet *facet;
1281 ofproto->consistency_rl = time_msec() + 250;
1283 table = CONTAINER_OF(hmap_random_node(&ofproto->facets.tables),
1284 struct cls_table, hmap_node);
1285 cr = CONTAINER_OF(hmap_random_node(&table->rules), struct cls_rule,
1287 facet = CONTAINER_OF(cr, struct facet, cr);
1289 if (!tag_set_intersects(&ofproto->backer->revalidate_set,
1290 facet->xout.tags)) {
1291 if (!facet_check_consistency(facet)) {
1292 ofproto->backer->need_revalidate = REV_INCONSISTENCY;
1301 wait(struct ofproto *ofproto_)
1303 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
1304 struct ofport_dpif *ofport;
1305 struct ofbundle *bundle;
1307 if (!clogged && !list_is_empty(&ofproto->completions)) {
1308 poll_immediate_wake();
1311 if (ofproto_get_flow_restore_wait()) {
1315 dpif_wait(ofproto->backer->dpif);
1316 dpif_recv_wait(ofproto->backer->dpif);
1317 if (ofproto->sflow) {
1318 dpif_sflow_wait(ofproto->sflow);
1320 if (!tag_set_is_empty(&ofproto->backer->revalidate_set)) {
1321 poll_immediate_wake();
1323 HMAP_FOR_EACH (ofport, up.hmap_node, &ofproto->up.ports) {
1326 HMAP_FOR_EACH (bundle, hmap_node, &ofproto->bundles) {
1327 bundle_wait(bundle);
1329 if (ofproto->netflow) {
1330 netflow_wait(ofproto->netflow);
1332 mac_learning_wait(ofproto->ml);
1334 if (ofproto->backer->need_revalidate) {
1335 /* Shouldn't happen, but if it does just go around again. */
1336 VLOG_DBG_RL(&rl, "need revalidate in ofproto_wait_cb()");
1337 poll_immediate_wake();
1342 get_memory_usage(const struct ofproto *ofproto_, struct simap *usage)
1344 const struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
1345 struct cls_cursor cursor;
1346 size_t n_subfacets = 0;
1347 struct facet *facet;
1349 simap_increase(usage, "facets", classifier_count(&ofproto->facets));
1351 cls_cursor_init(&cursor, &ofproto->facets, NULL);
1352 CLS_CURSOR_FOR_EACH (facet, cr, &cursor) {
1353 n_subfacets += list_size(&facet->subfacets);
1355 simap_increase(usage, "subfacets", n_subfacets);
1359 flush(struct ofproto *ofproto_)
1361 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
1362 struct subfacet *subfacet, *next_subfacet;
1363 struct subfacet *batch[SUBFACET_DESTROY_MAX_BATCH];
1367 HMAP_FOR_EACH_SAFE (subfacet, next_subfacet, hmap_node,
1368 &ofproto->backer->subfacets) {
1369 if (ofproto_dpif_cast(subfacet->facet->rule->up.ofproto) != ofproto) {
1373 if (subfacet->path != SF_NOT_INSTALLED) {
1374 batch[n_batch++] = subfacet;
1375 if (n_batch >= SUBFACET_DESTROY_MAX_BATCH) {
1376 subfacet_destroy_batch(ofproto->backer, batch, n_batch);
1380 subfacet_destroy(subfacet);
1385 subfacet_destroy_batch(ofproto->backer, batch, n_batch);
1390 get_features(struct ofproto *ofproto_ OVS_UNUSED,
1391 bool *arp_match_ip, enum ofputil_action_bitmap *actions)
1393 *arp_match_ip = true;
1394 *actions = (OFPUTIL_A_OUTPUT |
1395 OFPUTIL_A_SET_VLAN_VID |
1396 OFPUTIL_A_SET_VLAN_PCP |
1397 OFPUTIL_A_STRIP_VLAN |
1398 OFPUTIL_A_SET_DL_SRC |
1399 OFPUTIL_A_SET_DL_DST |
1400 OFPUTIL_A_SET_NW_SRC |
1401 OFPUTIL_A_SET_NW_DST |
1402 OFPUTIL_A_SET_NW_TOS |
1403 OFPUTIL_A_SET_TP_SRC |
1404 OFPUTIL_A_SET_TP_DST |
1409 get_tables(struct ofproto *ofproto_, struct ofp12_table_stats *ots)
1411 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
1412 struct dpif_dp_stats s;
1413 uint64_t n_miss, n_no_pkt_in, n_bytes, n_dropped_frags;
1416 strcpy(ots->name, "classifier");
1418 dpif_get_dp_stats(ofproto->backer->dpif, &s);
1419 rule_get_stats(&ofproto->miss_rule->up, &n_miss, &n_bytes);
1420 rule_get_stats(&ofproto->no_packet_in_rule->up, &n_no_pkt_in, &n_bytes);
1421 rule_get_stats(&ofproto->drop_frags_rule->up, &n_dropped_frags, &n_bytes);
1423 n_lookup = s.n_hit + s.n_missed - n_dropped_frags;
1424 ots->lookup_count = htonll(n_lookup);
1425 ots->matched_count = htonll(n_lookup - n_miss - n_no_pkt_in);
1428 static struct ofport *
1431 struct ofport_dpif *port = xmalloc(sizeof *port);
1436 port_dealloc(struct ofport *port_)
1438 struct ofport_dpif *port = ofport_dpif_cast(port_);
1443 port_construct(struct ofport *port_)
1445 struct ofport_dpif *port = ofport_dpif_cast(port_);
1446 struct ofproto_dpif *ofproto = ofproto_dpif_cast(port->up.ofproto);
1447 const struct netdev *netdev = port->up.netdev;
1448 char namebuf[NETDEV_VPORT_NAME_BUFSIZE];
1449 struct dpif_port dpif_port;
1452 ofproto->backer->need_revalidate = REV_RECONFIGURE;
1453 port->bundle = NULL;
1456 port->tag = tag_create_random();
1457 port->may_enable = true;
1458 port->stp_port = NULL;
1459 port->stp_state = STP_DISABLED;
1460 port->tnl_port = NULL;
1462 hmap_init(&port->priorities);
1463 port->realdev_ofp_port = 0;
1464 port->vlandev_vid = 0;
1465 port->carrier_seq = netdev_get_carrier_resets(netdev);
1467 if (netdev_vport_is_patch(netdev)) {
1468 /* By bailing out here, we don't submit the port to the sFlow module
1469 * to be considered for counter polling export. This is correct
1470 * because the patch port represents an interface that sFlow considers
1471 * to be "internal" to the switch as a whole, and therefore not an
1472 * candidate for counter polling. */
1473 port->odp_port = ODPP_NONE;
1474 ofport_update_peer(port);
1478 error = dpif_port_query_by_name(ofproto->backer->dpif,
1479 netdev_vport_get_dpif_port(netdev, namebuf,
1486 port->odp_port = dpif_port.port_no;
1488 if (netdev_get_tunnel_config(netdev)) {
1489 port->tnl_port = tnl_port_add(&port->up, port->odp_port);
1491 /* Sanity-check that a mapping doesn't already exist. This
1492 * shouldn't happen for non-tunnel ports. */
1493 if (odp_port_to_ofp_port(ofproto, port->odp_port) != OFPP_NONE) {
1494 VLOG_ERR("port %s already has an OpenFlow port number",
1496 dpif_port_destroy(&dpif_port);
1500 hmap_insert(&ofproto->backer->odp_to_ofport_map, &port->odp_port_node,
1501 hash_odp_port(port->odp_port));
1503 dpif_port_destroy(&dpif_port);
1505 if (ofproto->sflow) {
1506 dpif_sflow_add_port(ofproto->sflow, port_, port->odp_port);
1513 port_destruct(struct ofport *port_)
1515 struct ofport_dpif *port = ofport_dpif_cast(port_);
1516 struct ofproto_dpif *ofproto = ofproto_dpif_cast(port->up.ofproto);
1517 const char *devname = netdev_get_name(port->up.netdev);
1518 char namebuf[NETDEV_VPORT_NAME_BUFSIZE];
1519 const char *dp_port_name;
1521 ofproto->backer->need_revalidate = REV_RECONFIGURE;
1523 dp_port_name = netdev_vport_get_dpif_port(port->up.netdev, namebuf,
1525 if (dpif_port_exists(ofproto->backer->dpif, dp_port_name)) {
1526 /* The underlying device is still there, so delete it. This
1527 * happens when the ofproto is being destroyed, since the caller
1528 * assumes that removal of attached ports will happen as part of
1530 if (!port->tnl_port) {
1531 dpif_port_del(ofproto->backer->dpif, port->odp_port);
1536 port->peer->peer = NULL;
1540 if (port->odp_port != ODPP_NONE && !port->tnl_port) {
1541 hmap_remove(&ofproto->backer->odp_to_ofport_map, &port->odp_port_node);
1544 tnl_port_del(port->tnl_port);
1545 sset_find_and_delete(&ofproto->ports, devname);
1546 sset_find_and_delete(&ofproto->ghost_ports, devname);
1547 bundle_remove(port_);
1548 set_cfm(port_, NULL);
1549 set_bfd(port_, NULL);
1550 if (ofproto->sflow) {
1551 dpif_sflow_del_port(ofproto->sflow, port->odp_port);
1554 ofport_clear_priorities(port);
1555 hmap_destroy(&port->priorities);
1559 port_modified(struct ofport *port_)
1561 struct ofport_dpif *port = ofport_dpif_cast(port_);
1563 if (port->bundle && port->bundle->bond) {
1564 bond_slave_set_netdev(port->bundle->bond, port, port->up.netdev);
1568 cfm_set_netdev(port->cfm, port->up.netdev);
1571 if (port->tnl_port && tnl_port_reconfigure(&port->up, port->odp_port,
1573 ofproto_dpif_cast(port->up.ofproto)->backer->need_revalidate =
1577 ofport_update_peer(port);
1581 port_reconfigured(struct ofport *port_, enum ofputil_port_config old_config)
1583 struct ofport_dpif *port = ofport_dpif_cast(port_);
1584 struct ofproto_dpif *ofproto = ofproto_dpif_cast(port->up.ofproto);
1585 enum ofputil_port_config changed = old_config ^ port->up.pp.config;
1587 if (changed & (OFPUTIL_PC_NO_RECV | OFPUTIL_PC_NO_RECV_STP |
1588 OFPUTIL_PC_NO_FWD | OFPUTIL_PC_NO_FLOOD |
1589 OFPUTIL_PC_NO_PACKET_IN)) {
1590 ofproto->backer->need_revalidate = REV_RECONFIGURE;
1592 if (changed & OFPUTIL_PC_NO_FLOOD && port->bundle) {
1593 bundle_update(port->bundle);
1599 set_sflow(struct ofproto *ofproto_,
1600 const struct ofproto_sflow_options *sflow_options)
1602 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
1603 struct dpif_sflow *ds = ofproto->sflow;
1605 if (sflow_options) {
1607 struct ofport_dpif *ofport;
1609 ds = ofproto->sflow = dpif_sflow_create();
1610 HMAP_FOR_EACH (ofport, up.hmap_node, &ofproto->up.ports) {
1611 dpif_sflow_add_port(ds, &ofport->up, ofport->odp_port);
1613 ofproto->backer->need_revalidate = REV_RECONFIGURE;
1615 dpif_sflow_set_options(ds, sflow_options);
1618 dpif_sflow_unref(ds);
1619 ofproto->backer->need_revalidate = REV_RECONFIGURE;
1620 ofproto->sflow = NULL;
1628 struct ofproto *ofproto_,
1629 const struct ofproto_ipfix_bridge_exporter_options *bridge_exporter_options,
1630 const struct ofproto_ipfix_flow_exporter_options *flow_exporters_options,
1631 size_t n_flow_exporters_options)
1633 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
1634 struct dpif_ipfix *di = ofproto->ipfix;
1636 if (bridge_exporter_options || flow_exporters_options) {
1638 di = ofproto->ipfix = dpif_ipfix_create();
1640 dpif_ipfix_set_options(
1641 di, bridge_exporter_options, flow_exporters_options,
1642 n_flow_exporters_options);
1645 dpif_ipfix_unref(di);
1646 ofproto->ipfix = NULL;
1653 set_cfm(struct ofport *ofport_, const struct cfm_settings *s)
1655 struct ofport_dpif *ofport = ofport_dpif_cast(ofport_);
1662 struct ofproto_dpif *ofproto;
1664 ofproto = ofproto_dpif_cast(ofport->up.ofproto);
1665 ofproto->backer->need_revalidate = REV_RECONFIGURE;
1666 ofport->cfm = cfm_create(ofport->up.netdev);
1669 if (cfm_configure(ofport->cfm, s)) {
1675 cfm_unref(ofport->cfm);
1681 get_cfm_status(const struct ofport *ofport_,
1682 struct ofproto_cfm_status *status)
1684 struct ofport_dpif *ofport = ofport_dpif_cast(ofport_);
1687 status->faults = cfm_get_fault(ofport->cfm);
1688 status->remote_opstate = cfm_get_opup(ofport->cfm);
1689 status->health = cfm_get_health(ofport->cfm);
1690 cfm_get_remote_mpids(ofport->cfm, &status->rmps, &status->n_rmps);
1698 set_bfd(struct ofport *ofport_, const struct smap *cfg)
1700 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofport_->ofproto);
1701 struct ofport_dpif *ofport = ofport_dpif_cast(ofport_);
1705 ofport->bfd = bfd_configure(old, netdev_get_name(ofport->up.netdev), cfg);
1706 if (ofport->bfd != old) {
1707 ofproto->backer->need_revalidate = REV_RECONFIGURE;
1714 get_bfd_status(struct ofport *ofport_, struct smap *smap)
1716 struct ofport_dpif *ofport = ofport_dpif_cast(ofport_);
1719 bfd_get_status(ofport->bfd, smap);
1726 /* Spanning Tree. */
1729 send_bpdu_cb(struct ofpbuf *pkt, int port_num, void *ofproto_)
1731 struct ofproto_dpif *ofproto = ofproto_;
1732 struct stp_port *sp = stp_get_port(ofproto->stp, port_num);
1733 struct ofport_dpif *ofport;
1735 ofport = stp_port_get_aux(sp);
1737 VLOG_WARN_RL(&rl, "%s: cannot send BPDU on unknown port %d",
1738 ofproto->up.name, port_num);
1740 struct eth_header *eth = pkt->l2;
1742 netdev_get_etheraddr(ofport->up.netdev, eth->eth_src);
1743 if (eth_addr_is_zero(eth->eth_src)) {
1744 VLOG_WARN_RL(&rl, "%s: cannot send BPDU on port %d "
1745 "with unknown MAC", ofproto->up.name, port_num);
1747 send_packet(ofport, pkt);
1753 /* Configures STP on 'ofproto_' using the settings defined in 's'. */
1755 set_stp(struct ofproto *ofproto_, const struct ofproto_stp_settings *s)
1757 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
1759 /* Only revalidate flows if the configuration changed. */
1760 if (!s != !ofproto->stp) {
1761 ofproto->backer->need_revalidate = REV_RECONFIGURE;
1765 if (!ofproto->stp) {
1766 ofproto->stp = stp_create(ofproto_->name, s->system_id,
1767 send_bpdu_cb, ofproto);
1768 ofproto->stp_last_tick = time_msec();
1771 stp_set_bridge_id(ofproto->stp, s->system_id);
1772 stp_set_bridge_priority(ofproto->stp, s->priority);
1773 stp_set_hello_time(ofproto->stp, s->hello_time);
1774 stp_set_max_age(ofproto->stp, s->max_age);
1775 stp_set_forward_delay(ofproto->stp, s->fwd_delay);
1777 struct ofport *ofport;
1779 HMAP_FOR_EACH (ofport, hmap_node, &ofproto->up.ports) {
1780 set_stp_port(ofport, NULL);
1783 stp_destroy(ofproto->stp);
1784 ofproto->stp = NULL;
1791 get_stp_status(struct ofproto *ofproto_, struct ofproto_stp_status *s)
1793 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
1797 s->bridge_id = stp_get_bridge_id(ofproto->stp);
1798 s->designated_root = stp_get_designated_root(ofproto->stp);
1799 s->root_path_cost = stp_get_root_path_cost(ofproto->stp);
1808 update_stp_port_state(struct ofport_dpif *ofport)
1810 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofport->up.ofproto);
1811 enum stp_state state;
1813 /* Figure out new state. */
1814 state = ofport->stp_port ? stp_port_get_state(ofport->stp_port)
1818 if (ofport->stp_state != state) {
1819 enum ofputil_port_state of_state;
1822 VLOG_DBG_RL(&rl, "port %s: STP state changed from %s to %s",
1823 netdev_get_name(ofport->up.netdev),
1824 stp_state_name(ofport->stp_state),
1825 stp_state_name(state));
1826 if (stp_learn_in_state(ofport->stp_state)
1827 != stp_learn_in_state(state)) {
1828 /* xxx Learning action flows should also be flushed. */
1829 mac_learning_flush(ofproto->ml,
1830 &ofproto->backer->revalidate_set);
1832 fwd_change = stp_forward_in_state(ofport->stp_state)
1833 != stp_forward_in_state(state);
1835 ofproto->backer->need_revalidate = REV_STP;
1836 ofport->stp_state = state;
1837 ofport->stp_state_entered = time_msec();
1839 if (fwd_change && ofport->bundle) {
1840 bundle_update(ofport->bundle);
1843 /* Update the STP state bits in the OpenFlow port description. */
1844 of_state = ofport->up.pp.state & ~OFPUTIL_PS_STP_MASK;
1845 of_state |= (state == STP_LISTENING ? OFPUTIL_PS_STP_LISTEN
1846 : state == STP_LEARNING ? OFPUTIL_PS_STP_LEARN
1847 : state == STP_FORWARDING ? OFPUTIL_PS_STP_FORWARD
1848 : state == STP_BLOCKING ? OFPUTIL_PS_STP_BLOCK
1850 ofproto_port_set_state(&ofport->up, of_state);
1854 /* Configures STP on 'ofport_' using the settings defined in 's'. The
1855 * caller is responsible for assigning STP port numbers and ensuring
1856 * there are no duplicates. */
1858 set_stp_port(struct ofport *ofport_,
1859 const struct ofproto_port_stp_settings *s)
1861 struct ofport_dpif *ofport = ofport_dpif_cast(ofport_);
1862 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofport->up.ofproto);
1863 struct stp_port *sp = ofport->stp_port;
1865 if (!s || !s->enable) {
1867 ofport->stp_port = NULL;
1868 stp_port_disable(sp);
1869 update_stp_port_state(ofport);
1872 } else if (sp && stp_port_no(sp) != s->port_num
1873 && ofport == stp_port_get_aux(sp)) {
1874 /* The port-id changed, so disable the old one if it's not
1875 * already in use by another port. */
1876 stp_port_disable(sp);
1879 sp = ofport->stp_port = stp_get_port(ofproto->stp, s->port_num);
1880 stp_port_enable(sp);
1882 stp_port_set_aux(sp, ofport);
1883 stp_port_set_priority(sp, s->priority);
1884 stp_port_set_path_cost(sp, s->path_cost);
1886 update_stp_port_state(ofport);
1892 get_stp_port_status(struct ofport *ofport_,
1893 struct ofproto_port_stp_status *s)
1895 struct ofport_dpif *ofport = ofport_dpif_cast(ofport_);
1896 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofport->up.ofproto);
1897 struct stp_port *sp = ofport->stp_port;
1899 if (!ofproto->stp || !sp) {
1905 s->port_id = stp_port_get_id(sp);
1906 s->state = stp_port_get_state(sp);
1907 s->sec_in_state = (time_msec() - ofport->stp_state_entered) / 1000;
1908 s->role = stp_port_get_role(sp);
1909 stp_port_get_counts(sp, &s->tx_count, &s->rx_count, &s->error_count);
1915 stp_run(struct ofproto_dpif *ofproto)
1918 long long int now = time_msec();
1919 long long int elapsed = now - ofproto->stp_last_tick;
1920 struct stp_port *sp;
1923 stp_tick(ofproto->stp, MIN(INT_MAX, elapsed));
1924 ofproto->stp_last_tick = now;
1926 while (stp_get_changed_port(ofproto->stp, &sp)) {
1927 struct ofport_dpif *ofport = stp_port_get_aux(sp);
1930 update_stp_port_state(ofport);
1934 if (stp_check_and_reset_fdb_flush(ofproto->stp)) {
1935 mac_learning_flush(ofproto->ml, &ofproto->backer->revalidate_set);
1941 stp_wait(struct ofproto_dpif *ofproto)
1944 poll_timer_wait(1000);
1948 /* Returns true if STP should process 'flow'. Sets fields in 'wc' that
1949 * were used to make the determination.*/
1951 stp_should_process_flow(const struct flow *flow, struct flow_wildcards *wc)
1953 memset(&wc->masks.dl_dst, 0xff, sizeof wc->masks.dl_dst);
1954 return eth_addr_equals(flow->dl_dst, eth_addr_stp);
1958 stp_process_packet(const struct ofport_dpif *ofport,
1959 const struct ofpbuf *packet)
1961 struct ofpbuf payload = *packet;
1962 struct eth_header *eth = payload.data;
1963 struct stp_port *sp = ofport->stp_port;
1965 /* Sink packets on ports that have STP disabled when the bridge has
1967 if (!sp || stp_port_get_state(sp) == STP_DISABLED) {
1971 /* Trim off padding on payload. */
1972 if (payload.size > ntohs(eth->eth_type) + ETH_HEADER_LEN) {
1973 payload.size = ntohs(eth->eth_type) + ETH_HEADER_LEN;
1976 if (ofpbuf_try_pull(&payload, ETH_HEADER_LEN + LLC_HEADER_LEN)) {
1977 stp_received_bpdu(sp, payload.data, payload.size);
1982 ofproto_dpif_queue_to_priority(const struct ofproto_dpif *ofproto,
1983 uint32_t queue_id, uint32_t *priority)
1985 return dpif_queue_to_priority(ofproto->backer->dpif, queue_id, priority);
1988 static struct priority_to_dscp *
1989 get_priority(const struct ofport_dpif *ofport, uint32_t priority)
1991 struct priority_to_dscp *pdscp;
1994 hash = hash_int(priority, 0);
1995 HMAP_FOR_EACH_IN_BUCKET (pdscp, hmap_node, hash, &ofport->priorities) {
1996 if (pdscp->priority == priority) {
2004 ofproto_dpif_dscp_from_priority(const struct ofport_dpif *ofport,
2005 uint32_t priority, uint8_t *dscp)
2007 struct priority_to_dscp *pdscp = get_priority(ofport, priority);
2008 *dscp = pdscp ? pdscp->dscp : 0;
2009 return pdscp != NULL;
2013 ofport_clear_priorities(struct ofport_dpif *ofport)
2015 struct priority_to_dscp *pdscp, *next;
2017 HMAP_FOR_EACH_SAFE (pdscp, next, hmap_node, &ofport->priorities) {
2018 hmap_remove(&ofport->priorities, &pdscp->hmap_node);
2024 set_queues(struct ofport *ofport_,
2025 const struct ofproto_port_queue *qdscp_list,
2028 struct ofport_dpif *ofport = ofport_dpif_cast(ofport_);
2029 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofport->up.ofproto);
2030 struct hmap new = HMAP_INITIALIZER(&new);
2033 for (i = 0; i < n_qdscp; i++) {
2034 struct priority_to_dscp *pdscp;
2038 dscp = (qdscp_list[i].dscp << 2) & IP_DSCP_MASK;
2039 if (dpif_queue_to_priority(ofproto->backer->dpif, qdscp_list[i].queue,
2044 pdscp = get_priority(ofport, priority);
2046 hmap_remove(&ofport->priorities, &pdscp->hmap_node);
2048 pdscp = xmalloc(sizeof *pdscp);
2049 pdscp->priority = priority;
2051 ofproto->backer->need_revalidate = REV_RECONFIGURE;
2054 if (pdscp->dscp != dscp) {
2056 ofproto->backer->need_revalidate = REV_RECONFIGURE;
2059 hmap_insert(&new, &pdscp->hmap_node, hash_int(pdscp->priority, 0));
2062 if (!hmap_is_empty(&ofport->priorities)) {
2063 ofport_clear_priorities(ofport);
2064 ofproto->backer->need_revalidate = REV_RECONFIGURE;
2067 hmap_swap(&new, &ofport->priorities);
2075 /* Expires all MAC learning entries associated with 'bundle' and forces its
2076 * ofproto to revalidate every flow.
2078 * Normally MAC learning entries are removed only from the ofproto associated
2079 * with 'bundle', but if 'all_ofprotos' is true, then the MAC learning entries
2080 * are removed from every ofproto. When patch ports and SLB bonds are in use
2081 * and a VM migration happens and the gratuitous ARPs are somehow lost, this
2082 * avoids a MAC_ENTRY_IDLE_TIME delay before the migrated VM can communicate
2083 * with the host from which it migrated. */
2085 bundle_flush_macs(struct ofbundle *bundle, bool all_ofprotos)
2087 struct ofproto_dpif *ofproto = bundle->ofproto;
2088 struct mac_learning *ml = ofproto->ml;
2089 struct mac_entry *mac, *next_mac;
2091 ofproto->backer->need_revalidate = REV_RECONFIGURE;
2092 LIST_FOR_EACH_SAFE (mac, next_mac, lru_node, &ml->lrus) {
2093 if (mac->port.p == bundle) {
2095 struct ofproto_dpif *o;
2097 HMAP_FOR_EACH (o, all_ofproto_dpifs_node, &all_ofproto_dpifs) {
2099 struct mac_entry *e;
2101 e = mac_learning_lookup(o->ml, mac->mac, mac->vlan,
2104 mac_learning_expire(o->ml, e);
2110 mac_learning_expire(ml, mac);
2115 static struct ofbundle *
2116 bundle_lookup(const struct ofproto_dpif *ofproto, void *aux)
2118 struct ofbundle *bundle;
2120 HMAP_FOR_EACH_IN_BUCKET (bundle, hmap_node, hash_pointer(aux, 0),
2121 &ofproto->bundles) {
2122 if (bundle->aux == aux) {
2129 /* Looks up each of the 'n_auxes' pointers in 'auxes' as bundles and adds the
2130 * ones that are found to 'bundles'. */
2132 bundle_lookup_multiple(struct ofproto_dpif *ofproto,
2133 void **auxes, size_t n_auxes,
2134 struct hmapx *bundles)
2138 hmapx_init(bundles);
2139 for (i = 0; i < n_auxes; i++) {
2140 struct ofbundle *bundle = bundle_lookup(ofproto, auxes[i]);
2142 hmapx_add(bundles, bundle);
2148 bundle_update(struct ofbundle *bundle)
2150 struct ofport_dpif *port;
2152 bundle->floodable = true;
2153 LIST_FOR_EACH (port, bundle_node, &bundle->ports) {
2154 if (port->up.pp.config & OFPUTIL_PC_NO_FLOOD
2155 || !stp_forward_in_state(port->stp_state)) {
2156 bundle->floodable = false;
2163 bundle_del_port(struct ofport_dpif *port)
2165 struct ofbundle *bundle = port->bundle;
2167 bundle->ofproto->backer->need_revalidate = REV_RECONFIGURE;
2169 list_remove(&port->bundle_node);
2170 port->bundle = NULL;
2173 lacp_slave_unregister(bundle->lacp, port);
2176 bond_slave_unregister(bundle->bond, port);
2179 bundle_update(bundle);
2183 bundle_add_port(struct ofbundle *bundle, ofp_port_t ofp_port,
2184 struct lacp_slave_settings *lacp)
2186 struct ofport_dpif *port;
2188 port = get_ofp_port(bundle->ofproto, ofp_port);
2193 if (port->bundle != bundle) {
2194 bundle->ofproto->backer->need_revalidate = REV_RECONFIGURE;
2196 bundle_del_port(port);
2199 port->bundle = bundle;
2200 list_push_back(&bundle->ports, &port->bundle_node);
2201 if (port->up.pp.config & OFPUTIL_PC_NO_FLOOD
2202 || !stp_forward_in_state(port->stp_state)) {
2203 bundle->floodable = false;
2207 bundle->ofproto->backer->need_revalidate = REV_RECONFIGURE;
2208 lacp_slave_register(bundle->lacp, port, lacp);
2215 bundle_destroy(struct ofbundle *bundle)
2217 struct ofproto_dpif *ofproto;
2218 struct ofport_dpif *port, *next_port;
2225 ofproto = bundle->ofproto;
2226 for (i = 0; i < MAX_MIRRORS; i++) {
2227 struct ofmirror *m = ofproto->mirrors[i];
2229 if (m->out == bundle) {
2231 } else if (hmapx_find_and_delete(&m->srcs, bundle)
2232 || hmapx_find_and_delete(&m->dsts, bundle)) {
2233 ofproto->backer->need_revalidate = REV_RECONFIGURE;
2238 LIST_FOR_EACH_SAFE (port, next_port, bundle_node, &bundle->ports) {
2239 bundle_del_port(port);
2242 bundle_flush_macs(bundle, true);
2243 hmap_remove(&ofproto->bundles, &bundle->hmap_node);
2245 free(bundle->trunks);
2246 lacp_unref(bundle->lacp);
2247 bond_unref(bundle->bond);
2252 bundle_set(struct ofproto *ofproto_, void *aux,
2253 const struct ofproto_bundle_settings *s)
2255 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
2256 bool need_flush = false;
2257 struct ofport_dpif *port;
2258 struct ofbundle *bundle;
2259 unsigned long *trunks;
2265 bundle_destroy(bundle_lookup(ofproto, aux));
2269 ovs_assert(s->n_slaves == 1 || s->bond != NULL);
2270 ovs_assert((s->lacp != NULL) == (s->lacp_slaves != NULL));
2272 bundle = bundle_lookup(ofproto, aux);
2274 bundle = xmalloc(sizeof *bundle);
2276 bundle->ofproto = ofproto;
2277 hmap_insert(&ofproto->bundles, &bundle->hmap_node,
2278 hash_pointer(aux, 0));
2280 bundle->name = NULL;
2282 list_init(&bundle->ports);
2283 bundle->vlan_mode = PORT_VLAN_TRUNK;
2285 bundle->trunks = NULL;
2286 bundle->use_priority_tags = s->use_priority_tags;
2287 bundle->lacp = NULL;
2288 bundle->bond = NULL;
2290 bundle->floodable = true;
2292 bundle->src_mirrors = 0;
2293 bundle->dst_mirrors = 0;
2294 bundle->mirror_out = 0;
2297 if (!bundle->name || strcmp(s->name, bundle->name)) {
2299 bundle->name = xstrdup(s->name);
2304 if (!bundle->lacp) {
2305 ofproto->backer->need_revalidate = REV_RECONFIGURE;
2306 bundle->lacp = lacp_create();
2308 lacp_configure(bundle->lacp, s->lacp);
2310 lacp_unref(bundle->lacp);
2311 bundle->lacp = NULL;
2314 /* Update set of ports. */
2316 for (i = 0; i < s->n_slaves; i++) {
2317 if (!bundle_add_port(bundle, s->slaves[i],
2318 s->lacp ? &s->lacp_slaves[i] : NULL)) {
2322 if (!ok || list_size(&bundle->ports) != s->n_slaves) {
2323 struct ofport_dpif *next_port;
2325 LIST_FOR_EACH_SAFE (port, next_port, bundle_node, &bundle->ports) {
2326 for (i = 0; i < s->n_slaves; i++) {
2327 if (s->slaves[i] == port->up.ofp_port) {
2332 bundle_del_port(port);
2336 ovs_assert(list_size(&bundle->ports) <= s->n_slaves);
2338 if (list_is_empty(&bundle->ports)) {
2339 bundle_destroy(bundle);
2343 /* Set VLAN tagging mode */
2344 if (s->vlan_mode != bundle->vlan_mode
2345 || s->use_priority_tags != bundle->use_priority_tags) {
2346 bundle->vlan_mode = s->vlan_mode;
2347 bundle->use_priority_tags = s->use_priority_tags;
2352 vlan = (s->vlan_mode == PORT_VLAN_TRUNK ? -1
2353 : s->vlan >= 0 && s->vlan <= 4095 ? s->vlan
2355 if (vlan != bundle->vlan) {
2356 bundle->vlan = vlan;
2360 /* Get trunked VLANs. */
2361 switch (s->vlan_mode) {
2362 case PORT_VLAN_ACCESS:
2366 case PORT_VLAN_TRUNK:
2367 trunks = CONST_CAST(unsigned long *, s->trunks);
2370 case PORT_VLAN_NATIVE_UNTAGGED:
2371 case PORT_VLAN_NATIVE_TAGGED:
2372 if (vlan != 0 && (!s->trunks
2373 || !bitmap_is_set(s->trunks, vlan)
2374 || bitmap_is_set(s->trunks, 0))) {
2375 /* Force trunking the native VLAN and prohibit trunking VLAN 0. */
2377 trunks = bitmap_clone(s->trunks, 4096);
2379 trunks = bitmap_allocate1(4096);
2381 bitmap_set1(trunks, vlan);
2382 bitmap_set0(trunks, 0);
2384 trunks = CONST_CAST(unsigned long *, s->trunks);
2391 if (!vlan_bitmap_equal(trunks, bundle->trunks)) {
2392 free(bundle->trunks);
2393 if (trunks == s->trunks) {
2394 bundle->trunks = vlan_bitmap_clone(trunks);
2396 bundle->trunks = trunks;
2401 if (trunks != s->trunks) {
2406 if (!list_is_short(&bundle->ports)) {
2407 bundle->ofproto->has_bonded_bundles = true;
2409 if (bond_reconfigure(bundle->bond, s->bond)) {
2410 ofproto->backer->need_revalidate = REV_RECONFIGURE;
2413 bundle->bond = bond_create(s->bond);
2414 ofproto->backer->need_revalidate = REV_RECONFIGURE;
2417 LIST_FOR_EACH (port, bundle_node, &bundle->ports) {
2418 bond_slave_register(bundle->bond, port, port->up.netdev);
2421 bond_unref(bundle->bond);
2422 bundle->bond = NULL;
2425 /* If we changed something that would affect MAC learning, un-learn
2426 * everything on this port and force flow revalidation. */
2428 bundle_flush_macs(bundle, false);
2435 bundle_remove(struct ofport *port_)
2437 struct ofport_dpif *port = ofport_dpif_cast(port_);
2438 struct ofbundle *bundle = port->bundle;
2441 bundle_del_port(port);
2442 if (list_is_empty(&bundle->ports)) {
2443 bundle_destroy(bundle);
2444 } else if (list_is_short(&bundle->ports)) {
2445 bond_unref(bundle->bond);
2446 bundle->bond = NULL;
2452 send_pdu_cb(void *port_, const void *pdu, size_t pdu_size)
2454 static struct vlog_rate_limit rl = VLOG_RATE_LIMIT_INIT(1, 10);
2455 struct ofport_dpif *port = port_;
2456 uint8_t ea[ETH_ADDR_LEN];
2459 error = netdev_get_etheraddr(port->up.netdev, ea);
2461 struct ofpbuf packet;
2464 ofpbuf_init(&packet, 0);
2465 packet_pdu = eth_compose(&packet, eth_addr_lacp, ea, ETH_TYPE_LACP,
2467 memcpy(packet_pdu, pdu, pdu_size);
2469 send_packet(port, &packet);
2470 ofpbuf_uninit(&packet);
2472 VLOG_ERR_RL(&rl, "port %s: cannot obtain Ethernet address of iface "
2473 "%s (%s)", port->bundle->name,
2474 netdev_get_name(port->up.netdev), strerror(error));
2479 bundle_send_learning_packets(struct ofbundle *bundle)
2481 struct ofproto_dpif *ofproto = bundle->ofproto;
2482 int error, n_packets, n_errors;
2483 struct mac_entry *e;
2485 error = n_packets = n_errors = 0;
2486 LIST_FOR_EACH (e, lru_node, &ofproto->ml->lrus) {
2487 if (e->port.p != bundle) {
2488 struct ofpbuf *learning_packet;
2489 struct ofport_dpif *port;
2493 /* The assignment to "port" is unnecessary but makes "grep"ing for
2494 * struct ofport_dpif more effective. */
2495 learning_packet = bond_compose_learning_packet(bundle->bond,
2499 ret = send_packet(port, learning_packet);
2500 ofpbuf_delete(learning_packet);
2510 static struct vlog_rate_limit rl = VLOG_RATE_LIMIT_INIT(1, 5);
2511 VLOG_WARN_RL(&rl, "bond %s: %d errors sending %d gratuitous learning "
2512 "packets, last error was: %s",
2513 bundle->name, n_errors, n_packets, strerror(error));
2515 VLOG_DBG("bond %s: sent %d gratuitous learning packets",
2516 bundle->name, n_packets);
2521 bundle_run(struct ofbundle *bundle)
2524 lacp_run(bundle->lacp, send_pdu_cb);
2527 struct ofport_dpif *port;
2529 LIST_FOR_EACH (port, bundle_node, &bundle->ports) {
2530 bond_slave_set_may_enable(bundle->bond, port, port->may_enable);
2533 bond_run(bundle->bond, &bundle->ofproto->backer->revalidate_set,
2534 lacp_status(bundle->lacp));
2535 if (bond_should_send_learning_packets(bundle->bond)) {
2536 bundle_send_learning_packets(bundle);
2542 bundle_wait(struct ofbundle *bundle)
2545 lacp_wait(bundle->lacp);
2548 bond_wait(bundle->bond);
2555 mirror_scan(struct ofproto_dpif *ofproto)
2559 for (idx = 0; idx < MAX_MIRRORS; idx++) {
2560 if (!ofproto->mirrors[idx]) {
2567 static struct ofmirror *
2568 mirror_lookup(struct ofproto_dpif *ofproto, void *aux)
2572 for (i = 0; i < MAX_MIRRORS; i++) {
2573 struct ofmirror *mirror = ofproto->mirrors[i];
2574 if (mirror && mirror->aux == aux) {
2582 /* Update the 'dup_mirrors' member of each of the ofmirrors in 'ofproto'. */
2584 mirror_update_dups(struct ofproto_dpif *ofproto)
2588 for (i = 0; i < MAX_MIRRORS; i++) {
2589 struct ofmirror *m = ofproto->mirrors[i];
2592 m->dup_mirrors = MIRROR_MASK_C(1) << i;
2596 for (i = 0; i < MAX_MIRRORS; i++) {
2597 struct ofmirror *m1 = ofproto->mirrors[i];
2604 for (j = i + 1; j < MAX_MIRRORS; j++) {
2605 struct ofmirror *m2 = ofproto->mirrors[j];
2607 if (m2 && m1->out == m2->out && m1->out_vlan == m2->out_vlan) {
2608 m1->dup_mirrors |= MIRROR_MASK_C(1) << j;
2609 m2->dup_mirrors |= m1->dup_mirrors;
2616 mirror_set(struct ofproto *ofproto_, void *aux,
2617 const struct ofproto_mirror_settings *s)
2619 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
2620 mirror_mask_t mirror_bit;
2621 struct ofbundle *bundle;
2622 struct ofmirror *mirror;
2623 struct ofbundle *out;
2624 struct hmapx srcs; /* Contains "struct ofbundle *"s. */
2625 struct hmapx dsts; /* Contains "struct ofbundle *"s. */
2628 mirror = mirror_lookup(ofproto, aux);
2630 mirror_destroy(mirror);
2636 idx = mirror_scan(ofproto);
2638 VLOG_WARN("bridge %s: maximum of %d port mirrors reached, "
2640 ofproto->up.name, MAX_MIRRORS, s->name);
2644 mirror = ofproto->mirrors[idx] = xzalloc(sizeof *mirror);
2645 mirror->ofproto = ofproto;
2648 mirror->out_vlan = -1;
2649 mirror->name = NULL;
2652 if (!mirror->name || strcmp(s->name, mirror->name)) {
2654 mirror->name = xstrdup(s->name);
2657 /* Get the new configuration. */
2658 if (s->out_bundle) {
2659 out = bundle_lookup(ofproto, s->out_bundle);
2661 mirror_destroy(mirror);
2667 out_vlan = s->out_vlan;
2669 bundle_lookup_multiple(ofproto, s->srcs, s->n_srcs, &srcs);
2670 bundle_lookup_multiple(ofproto, s->dsts, s->n_dsts, &dsts);
2672 /* If the configuration has not changed, do nothing. */
2673 if (hmapx_equals(&srcs, &mirror->srcs)
2674 && hmapx_equals(&dsts, &mirror->dsts)
2675 && vlan_bitmap_equal(mirror->vlans, s->src_vlans)
2676 && mirror->out == out
2677 && mirror->out_vlan == out_vlan)
2679 hmapx_destroy(&srcs);
2680 hmapx_destroy(&dsts);
2684 hmapx_swap(&srcs, &mirror->srcs);
2685 hmapx_destroy(&srcs);
2687 hmapx_swap(&dsts, &mirror->dsts);
2688 hmapx_destroy(&dsts);
2690 free(mirror->vlans);
2691 mirror->vlans = vlan_bitmap_clone(s->src_vlans);
2694 mirror->out_vlan = out_vlan;
2696 /* Update bundles. */
2697 mirror_bit = MIRROR_MASK_C(1) << mirror->idx;
2698 HMAP_FOR_EACH (bundle, hmap_node, &mirror->ofproto->bundles) {
2699 if (hmapx_contains(&mirror->srcs, bundle)) {
2700 bundle->src_mirrors |= mirror_bit;
2702 bundle->src_mirrors &= ~mirror_bit;
2705 if (hmapx_contains(&mirror->dsts, bundle)) {
2706 bundle->dst_mirrors |= mirror_bit;
2708 bundle->dst_mirrors &= ~mirror_bit;
2711 if (mirror->out == bundle) {
2712 bundle->mirror_out |= mirror_bit;
2714 bundle->mirror_out &= ~mirror_bit;
2718 ofproto->backer->need_revalidate = REV_RECONFIGURE;
2719 ofproto->has_mirrors = true;
2720 mac_learning_flush(ofproto->ml,
2721 &ofproto->backer->revalidate_set);
2722 mirror_update_dups(ofproto);
2728 mirror_destroy(struct ofmirror *mirror)
2730 struct ofproto_dpif *ofproto;
2731 mirror_mask_t mirror_bit;
2732 struct ofbundle *bundle;
2739 ofproto = mirror->ofproto;
2740 ofproto->backer->need_revalidate = REV_RECONFIGURE;
2741 mac_learning_flush(ofproto->ml, &ofproto->backer->revalidate_set);
2743 mirror_bit = MIRROR_MASK_C(1) << mirror->idx;
2744 HMAP_FOR_EACH (bundle, hmap_node, &ofproto->bundles) {
2745 bundle->src_mirrors &= ~mirror_bit;
2746 bundle->dst_mirrors &= ~mirror_bit;
2747 bundle->mirror_out &= ~mirror_bit;
2750 hmapx_destroy(&mirror->srcs);
2751 hmapx_destroy(&mirror->dsts);
2752 free(mirror->vlans);
2754 ofproto->mirrors[mirror->idx] = NULL;
2758 mirror_update_dups(ofproto);
2760 ofproto->has_mirrors = false;
2761 for (i = 0; i < MAX_MIRRORS; i++) {
2762 if (ofproto->mirrors[i]) {
2763 ofproto->has_mirrors = true;
2770 mirror_get_stats(struct ofproto *ofproto_, void *aux,
2771 uint64_t *packets, uint64_t *bytes)
2773 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
2774 struct ofmirror *mirror = mirror_lookup(ofproto, aux);
2777 *packets = *bytes = UINT64_MAX;
2783 *packets = mirror->packet_count;
2784 *bytes = mirror->byte_count;
2790 set_flood_vlans(struct ofproto *ofproto_, unsigned long *flood_vlans)
2792 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
2793 if (mac_learning_set_flood_vlans(ofproto->ml, flood_vlans)) {
2794 mac_learning_flush(ofproto->ml, &ofproto->backer->revalidate_set);
2800 is_mirror_output_bundle(const struct ofproto *ofproto_, void *aux)
2802 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
2803 struct ofbundle *bundle = bundle_lookup(ofproto, aux);
2804 return bundle && bundle->mirror_out != 0;
2808 forward_bpdu_changed(struct ofproto *ofproto_)
2810 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
2811 ofproto->backer->need_revalidate = REV_RECONFIGURE;
2815 set_mac_table_config(struct ofproto *ofproto_, unsigned int idle_time,
2818 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
2819 mac_learning_set_idle_time(ofproto->ml, idle_time);
2820 mac_learning_set_max_entries(ofproto->ml, max_entries);
2825 struct ofport_dpif *
2826 get_ofp_port(const struct ofproto_dpif *ofproto, ofp_port_t ofp_port)
2828 struct ofport *ofport = ofproto_get_port(&ofproto->up, ofp_port);
2829 return ofport ? ofport_dpif_cast(ofport) : NULL;
2832 struct ofport_dpif *
2833 get_odp_port(const struct ofproto_dpif *ofproto, odp_port_t odp_port)
2835 struct ofport_dpif *port = odp_port_to_ofport(ofproto->backer, odp_port);
2836 return port && &ofproto->up == port->up.ofproto ? port : NULL;
2840 ofproto_port_from_dpif_port(struct ofproto_dpif *ofproto,
2841 struct ofproto_port *ofproto_port,
2842 struct dpif_port *dpif_port)
2844 ofproto_port->name = dpif_port->name;
2845 ofproto_port->type = dpif_port->type;
2846 ofproto_port->ofp_port = odp_port_to_ofp_port(ofproto, dpif_port->port_no);
2850 ofport_update_peer(struct ofport_dpif *ofport)
2852 const struct ofproto_dpif *ofproto;
2853 struct dpif_backer *backer;
2854 const char *peer_name;
2856 if (!netdev_vport_is_patch(ofport->up.netdev)) {
2860 backer = ofproto_dpif_cast(ofport->up.ofproto)->backer;
2861 backer->need_revalidate = REV_RECONFIGURE;
2864 ofport->peer->peer = NULL;
2865 ofport->peer = NULL;
2868 peer_name = netdev_vport_patch_peer(ofport->up.netdev);
2873 HMAP_FOR_EACH (ofproto, all_ofproto_dpifs_node, &all_ofproto_dpifs) {
2874 struct ofport *peer_ofport;
2875 struct ofport_dpif *peer;
2876 const char *peer_peer;
2878 if (ofproto->backer != backer) {
2882 peer_ofport = shash_find_data(&ofproto->up.port_by_name, peer_name);
2887 peer = ofport_dpif_cast(peer_ofport);
2888 peer_peer = netdev_vport_patch_peer(peer->up.netdev);
2889 if (peer_peer && !strcmp(netdev_get_name(ofport->up.netdev),
2891 ofport->peer = peer;
2892 ofport->peer->peer = ofport;
2900 port_run_fast(struct ofport_dpif *ofport)
2902 if (ofport->cfm && cfm_should_send_ccm(ofport->cfm)) {
2903 struct ofpbuf packet;
2905 ofpbuf_init(&packet, 0);
2906 cfm_compose_ccm(ofport->cfm, &packet, ofport->up.pp.hw_addr);
2907 send_packet(ofport, &packet);
2908 ofpbuf_uninit(&packet);
2911 if (ofport->bfd && bfd_should_send_packet(ofport->bfd)) {
2912 struct ofpbuf packet;
2914 ofpbuf_init(&packet, 0);
2915 bfd_put_packet(ofport->bfd, &packet, ofport->up.pp.hw_addr);
2916 send_packet(ofport, &packet);
2917 ofpbuf_uninit(&packet);
2922 port_run(struct ofport_dpif *ofport)
2924 long long int carrier_seq = netdev_get_carrier_resets(ofport->up.netdev);
2925 bool carrier_changed = carrier_seq != ofport->carrier_seq;
2926 bool enable = netdev_get_carrier(ofport->up.netdev);
2928 ofport->carrier_seq = carrier_seq;
2930 port_run_fast(ofport);
2933 int cfm_opup = cfm_get_opup(ofport->cfm);
2935 cfm_run(ofport->cfm);
2936 enable = enable && !cfm_get_fault(ofport->cfm);
2938 if (cfm_opup >= 0) {
2939 enable = enable && cfm_opup;
2944 bfd_run(ofport->bfd);
2945 enable = enable && bfd_forwarding(ofport->bfd);
2948 if (ofport->bundle) {
2949 enable = enable && lacp_slave_may_enable(ofport->bundle->lacp, ofport);
2950 if (carrier_changed) {
2951 lacp_slave_carrier_changed(ofport->bundle->lacp, ofport);
2955 if (ofport->may_enable != enable) {
2956 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofport->up.ofproto);
2957 ofproto->backer->need_revalidate = REV_PORT_TOGGLED;
2960 ofport->may_enable = enable;
2964 port_wait(struct ofport_dpif *ofport)
2967 cfm_wait(ofport->cfm);
2971 bfd_wait(ofport->bfd);
2976 port_query_by_name(const struct ofproto *ofproto_, const char *devname,
2977 struct ofproto_port *ofproto_port)
2979 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
2980 struct dpif_port dpif_port;
2983 if (sset_contains(&ofproto->ghost_ports, devname)) {
2984 const char *type = netdev_get_type_from_name(devname);
2986 /* We may be called before ofproto->up.port_by_name is populated with
2987 * the appropriate ofport. For this reason, we must get the name and
2988 * type from the netdev layer directly. */
2990 const struct ofport *ofport;
2992 ofport = shash_find_data(&ofproto->up.port_by_name, devname);
2993 ofproto_port->ofp_port = ofport ? ofport->ofp_port : OFPP_NONE;
2994 ofproto_port->name = xstrdup(devname);
2995 ofproto_port->type = xstrdup(type);
3001 if (!sset_contains(&ofproto->ports, devname)) {
3004 error = dpif_port_query_by_name(ofproto->backer->dpif,
3005 devname, &dpif_port);
3007 ofproto_port_from_dpif_port(ofproto, ofproto_port, &dpif_port);
3013 port_add(struct ofproto *ofproto_, struct netdev *netdev)
3015 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
3016 const char *devname = netdev_get_name(netdev);
3017 char namebuf[NETDEV_VPORT_NAME_BUFSIZE];
3018 const char *dp_port_name;
3020 if (netdev_vport_is_patch(netdev)) {
3021 sset_add(&ofproto->ghost_ports, netdev_get_name(netdev));
3025 dp_port_name = netdev_vport_get_dpif_port(netdev, namebuf, sizeof namebuf);
3026 if (!dpif_port_exists(ofproto->backer->dpif, dp_port_name)) {
3027 odp_port_t port_no = ODPP_NONE;
3030 error = dpif_port_add(ofproto->backer->dpif, netdev, &port_no);
3034 if (netdev_get_tunnel_config(netdev)) {
3035 simap_put(&ofproto->backer->tnl_backers,
3036 dp_port_name, odp_to_u32(port_no));
3040 if (netdev_get_tunnel_config(netdev)) {
3041 sset_add(&ofproto->ghost_ports, devname);
3043 sset_add(&ofproto->ports, devname);
3049 port_del(struct ofproto *ofproto_, ofp_port_t ofp_port)
3051 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
3052 struct ofport_dpif *ofport = get_ofp_port(ofproto, ofp_port);
3059 sset_find_and_delete(&ofproto->ghost_ports,
3060 netdev_get_name(ofport->up.netdev));
3061 ofproto->backer->need_revalidate = REV_RECONFIGURE;
3062 if (!ofport->tnl_port) {
3063 error = dpif_port_del(ofproto->backer->dpif, ofport->odp_port);
3065 /* The caller is going to close ofport->up.netdev. If this is a
3066 * bonded port, then the bond is using that netdev, so remove it
3067 * from the bond. The client will need to reconfigure everything
3068 * after deleting ports, so then the slave will get re-added. */
3069 bundle_remove(&ofport->up);
3076 port_get_stats(const struct ofport *ofport_, struct netdev_stats *stats)
3078 struct ofport_dpif *ofport = ofport_dpif_cast(ofport_);
3083 error = netdev_get_stats(ofport->up.netdev, stats);
3085 if (!error && ofport_->ofp_port == OFPP_LOCAL) {
3086 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofport->up.ofproto);
3088 /* ofproto->stats.tx_packets represents packets that we created
3089 * internally and sent to some port (e.g. packets sent with
3090 * send_packet()). Account for them as if they had come from
3091 * OFPP_LOCAL and got forwarded. */
3093 if (stats->rx_packets != UINT64_MAX) {
3094 stats->rx_packets += ofproto->stats.tx_packets;
3097 if (stats->rx_bytes != UINT64_MAX) {
3098 stats->rx_bytes += ofproto->stats.tx_bytes;
3101 /* ofproto->stats.rx_packets represents packets that were received on
3102 * some port and we processed internally and dropped (e.g. STP).
3103 * Account for them as if they had been forwarded to OFPP_LOCAL. */
3105 if (stats->tx_packets != UINT64_MAX) {
3106 stats->tx_packets += ofproto->stats.rx_packets;
3109 if (stats->tx_bytes != UINT64_MAX) {
3110 stats->tx_bytes += ofproto->stats.rx_bytes;
3117 struct port_dump_state {
3122 struct ofproto_port port;
3127 port_dump_start(const struct ofproto *ofproto_ OVS_UNUSED, void **statep)
3129 *statep = xzalloc(sizeof(struct port_dump_state));
3134 port_dump_next(const struct ofproto *ofproto_, void *state_,
3135 struct ofproto_port *port)
3137 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
3138 struct port_dump_state *state = state_;
3139 const struct sset *sset;
3140 struct sset_node *node;
3142 if (state->has_port) {
3143 ofproto_port_destroy(&state->port);
3144 state->has_port = false;
3146 sset = state->ghost ? &ofproto->ghost_ports : &ofproto->ports;
3147 while ((node = sset_at_position(sset, &state->bucket, &state->offset))) {
3150 error = port_query_by_name(ofproto_, node->name, &state->port);
3152 *port = state->port;
3153 state->has_port = true;
3155 } else if (error != ENODEV) {
3160 if (!state->ghost) {
3161 state->ghost = true;
3164 return port_dump_next(ofproto_, state_, port);
3171 port_dump_done(const struct ofproto *ofproto_ OVS_UNUSED, void *state_)
3173 struct port_dump_state *state = state_;
3175 if (state->has_port) {
3176 ofproto_port_destroy(&state->port);
3183 port_poll(const struct ofproto *ofproto_, char **devnamep)
3185 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
3187 if (ofproto->port_poll_errno) {
3188 int error = ofproto->port_poll_errno;
3189 ofproto->port_poll_errno = 0;
3193 if (sset_is_empty(&ofproto->port_poll_set)) {
3197 *devnamep = sset_pop(&ofproto->port_poll_set);
3202 port_poll_wait(const struct ofproto *ofproto_)
3204 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
3205 dpif_port_poll_wait(ofproto->backer->dpif);
3209 port_is_lacp_current(const struct ofport *ofport_)
3211 const struct ofport_dpif *ofport = ofport_dpif_cast(ofport_);
3212 return (ofport->bundle && ofport->bundle->lacp
3213 ? lacp_slave_is_current(ofport->bundle->lacp, ofport)
3217 /* Upcall handling. */
3219 /* Flow miss batching.
3221 * Some dpifs implement operations faster when you hand them off in a batch.
3222 * To allow batching, "struct flow_miss" queues the dpif-related work needed
3223 * for a given flow. Each "struct flow_miss" corresponds to sending one or
3224 * more packets, plus possibly installing the flow in the dpif.
3226 * So far we only batch the operations that affect flow setup time the most.
3227 * It's possible to batch more than that, but the benefit might be minimal. */
3229 struct hmap_node hmap_node;
3230 struct ofproto_dpif *ofproto;
3232 enum odp_key_fitness key_fitness;
3233 const struct nlattr *key;
3235 struct list packets;
3236 enum dpif_upcall_type upcall_type;
3239 struct flow_miss_op {
3240 struct dpif_op dpif_op;
3242 uint64_t slow_stub[128 / 8]; /* Buffer for compose_slow_path() */
3243 struct xlate_out xout;
3244 bool xout_garbage; /* 'xout' needs to be uninitialized? */
3246 struct ofpbuf mask; /* Flow mask for "put" ops. */
3247 struct odputil_keybuf maskbuf;
3249 /* If this is a "put" op, then a pointer to the subfacet that should
3250 * be marked as uninstalled if the operation fails. */
3251 struct subfacet *subfacet;
3254 /* Sends an OFPT_PACKET_IN message for 'packet' of type OFPR_NO_MATCH to each
3255 * OpenFlow controller as necessary according to their individual
3256 * configurations. */
3258 send_packet_in_miss(struct ofproto_dpif *ofproto, const struct ofpbuf *packet,
3259 const struct flow *flow)
3261 struct ofputil_packet_in pin;
3263 pin.packet = packet->data;
3264 pin.packet_len = packet->size;
3265 pin.reason = OFPR_NO_MATCH;
3266 pin.controller_id = 0;
3271 pin.send_len = 0; /* not used for flow table misses */
3273 flow_get_metadata(flow, &pin.fmd);
3275 connmgr_send_packet_in(ofproto->up.connmgr, &pin);
3278 static struct flow_miss *
3279 flow_miss_find(struct hmap *todo, const struct ofproto_dpif *ofproto,
3280 const struct flow *flow, uint32_t hash)
3282 struct flow_miss *miss;
3284 HMAP_FOR_EACH_WITH_HASH (miss, hmap_node, hash, todo) {
3285 if (miss->ofproto == ofproto && flow_equal(&miss->flow, flow)) {
3293 /* Partially Initializes 'op' as an "execute" operation for 'miss' and
3294 * 'packet'. The caller must initialize op->actions and op->actions_len. If
3295 * 'miss' is associated with a subfacet the caller must also initialize the
3296 * returned op->subfacet, and if anything needs to be freed after processing
3297 * the op, the caller must initialize op->garbage also. */
3299 init_flow_miss_execute_op(struct flow_miss *miss, struct ofpbuf *packet,
3300 struct flow_miss_op *op)
3302 if (miss->flow.in_port.ofp_port
3303 != vsp_realdev_to_vlandev(miss->ofproto, miss->flow.in_port.ofp_port,
3304 miss->flow.vlan_tci)) {
3305 /* This packet was received on a VLAN splinter port. We
3306 * added a VLAN to the packet to make the packet resemble
3307 * the flow, but the actions were composed assuming that
3308 * the packet contained no VLAN. So, we must remove the
3309 * VLAN header from the packet before trying to execute the
3311 eth_pop_vlan(packet);
3314 op->subfacet = NULL;
3315 op->xout_garbage = false;
3316 op->dpif_op.type = DPIF_OP_EXECUTE;
3317 op->dpif_op.u.execute.key = miss->key;
3318 op->dpif_op.u.execute.key_len = miss->key_len;
3319 op->dpif_op.u.execute.packet = packet;
3320 ofpbuf_use_stack(&op->mask, &op->maskbuf, sizeof op->maskbuf);
3323 /* Helper for handle_flow_miss_without_facet() and
3324 * handle_flow_miss_with_facet(). */
3326 handle_flow_miss_common(struct rule_dpif *rule,
3327 struct ofpbuf *packet, const struct flow *flow)
3329 struct ofproto_dpif *ofproto = ofproto_dpif_cast(rule->up.ofproto);
3331 if (rule->up.cr.priority == FAIL_OPEN_PRIORITY) {
3333 * Extra-special case for fail-open mode.
3335 * We are in fail-open mode and the packet matched the fail-open
3336 * rule, but we are connected to a controller too. We should send
3337 * the packet up to the controller in the hope that it will try to
3338 * set up a flow and thereby allow us to exit fail-open.
3340 * See the top-level comment in fail-open.c for more information.
3342 send_packet_in_miss(ofproto, packet, flow);
3346 /* Figures out whether a flow that missed in 'ofproto', whose details are in
3347 * 'miss' masked by 'wc', is likely to be worth tracking in detail in userspace
3348 * and (usually) installing a datapath flow. The answer is usually "yes" (a
3349 * return value of true). However, for short flows the cost of bookkeeping is
3350 * much higher than the benefits, so when the datapath holds a large number of
3351 * flows we impose some heuristics to decide which flows are likely to be worth
3354 flow_miss_should_make_facet(struct flow_miss *miss, struct flow_wildcards *wc)
3356 struct dpif_backer *backer = miss->ofproto->backer;
3359 switch (flow_miss_model) {
3360 case OFPROTO_HANDLE_MISS_AUTO:
3362 case OFPROTO_HANDLE_MISS_WITH_FACETS:
3364 case OFPROTO_HANDLE_MISS_WITHOUT_FACETS:
3368 if (!backer->governor) {
3371 n_subfacets = hmap_count(&backer->subfacets);
3372 if (n_subfacets * 2 <= flow_eviction_threshold) {
3376 backer->governor = governor_create();
3379 hash = flow_hash_in_wildcards(&miss->flow, wc, 0);
3380 return governor_should_install_flow(backer->governor, hash,
3381 list_size(&miss->packets));
3384 /* Handles 'miss' without creating a facet or subfacet or creating any datapath
3385 * flow. 'miss->flow' must have matched 'rule' and been xlated into 'xout'.
3386 * May add an "execute" operation to 'ops' and increment '*n_ops'. */
3388 handle_flow_miss_without_facet(struct rule_dpif *rule, struct xlate_out *xout,
3389 struct flow_miss *miss,
3390 struct flow_miss_op *ops, size_t *n_ops)
3392 struct ofpbuf *packet;
3394 LIST_FOR_EACH (packet, list_node, &miss->packets) {
3396 COVERAGE_INC(facet_suppress);
3398 handle_flow_miss_common(rule, packet, &miss->flow);
3401 struct xlate_in xin;
3403 xlate_in_init(&xin, miss->ofproto, &miss->flow, rule, 0, packet);
3404 xlate_actions_for_side_effects(&xin);
3407 if (xout->odp_actions.size) {
3408 struct flow_miss_op *op = &ops[*n_ops];
3409 struct dpif_execute *execute = &op->dpif_op.u.execute;
3411 init_flow_miss_execute_op(miss, packet, op);
3412 xlate_out_copy(&op->xout, xout);
3413 execute->actions = op->xout.odp_actions.data;
3414 execute->actions_len = op->xout.odp_actions.size;
3415 op->xout_garbage = true;
3422 /* Handles 'miss', which matches 'facet'. May add any required datapath
3423 * operations to 'ops', incrementing '*n_ops' for each new op.
3425 * All of the packets in 'miss' are considered to have arrived at time 'now'.
3426 * This is really important only for new facets: if we just called time_msec()
3427 * here, then the new subfacet or its packets could look (occasionally) as
3428 * though it was used some time after the facet was used. That can make a
3429 * one-packet flow look like it has a nonzero duration, which looks odd in
3430 * e.g. NetFlow statistics.
3432 * If non-null, 'stats' will be folded into 'facet'. */
3434 handle_flow_miss_with_facet(struct flow_miss *miss, struct facet *facet,
3435 long long int now, struct dpif_flow_stats *stats,
3436 struct flow_miss_op *ops, size_t *n_ops)
3438 struct ofproto_dpif *ofproto = ofproto_dpif_cast(facet->rule->up.ofproto);
3439 enum subfacet_path want_path;
3440 struct subfacet *subfacet;
3441 struct ofpbuf *packet;
3443 subfacet = subfacet_create(facet, miss, now);
3444 want_path = facet->xout.slow ? SF_SLOW_PATH : SF_FAST_PATH;
3446 subfacet_update_stats(subfacet, stats);
3449 LIST_FOR_EACH (packet, list_node, &miss->packets) {
3450 struct flow_miss_op *op = &ops[*n_ops];
3452 handle_flow_miss_common(facet->rule, packet, &miss->flow);
3454 if (want_path != SF_FAST_PATH) {
3455 struct xlate_in xin;
3457 xlate_in_init(&xin, ofproto, &miss->flow, facet->rule, 0, packet);
3458 xlate_actions_for_side_effects(&xin);
3461 if (facet->xout.odp_actions.size) {
3462 struct dpif_execute *execute = &op->dpif_op.u.execute;
3464 init_flow_miss_execute_op(miss, packet, op);
3465 execute->actions = facet->xout.odp_actions.data,
3466 execute->actions_len = facet->xout.odp_actions.size;
3471 if (miss->upcall_type == DPIF_UC_MISS || subfacet->path != want_path) {
3472 struct flow_miss_op *op = &ops[(*n_ops)++];
3473 struct dpif_flow_put *put = &op->dpif_op.u.flow_put;
3475 subfacet->path = want_path;
3477 ofpbuf_use_stack(&op->mask, &op->maskbuf, sizeof op->maskbuf);
3478 odp_flow_key_from_mask(&op->mask, &facet->xout.wc.masks,
3479 &miss->flow, UINT32_MAX);
3481 op->xout_garbage = false;
3482 op->dpif_op.type = DPIF_OP_FLOW_PUT;
3483 op->subfacet = subfacet;
3484 put->flags = DPIF_FP_CREATE | DPIF_FP_MODIFY;
3485 put->key = miss->key;
3486 put->key_len = miss->key_len;
3487 put->mask = op->mask.data;
3488 put->mask_len = op->mask.size;
3490 if (want_path == SF_FAST_PATH) {
3491 put->actions = facet->xout.odp_actions.data;
3492 put->actions_len = facet->xout.odp_actions.size;
3494 compose_slow_path(ofproto, &miss->flow, facet->xout.slow,
3495 op->slow_stub, sizeof op->slow_stub,
3496 &put->actions, &put->actions_len);
3502 /* Handles flow miss 'miss'. May add any required datapath operations
3503 * to 'ops', incrementing '*n_ops' for each new op. */
3505 handle_flow_miss(struct flow_miss *miss, struct flow_miss_op *ops,
3508 struct ofproto_dpif *ofproto = miss->ofproto;
3509 struct dpif_flow_stats stats__;
3510 struct dpif_flow_stats *stats = &stats__;
3511 struct ofpbuf *packet;
3512 struct facet *facet;
3516 memset(stats, 0, sizeof *stats);
3518 LIST_FOR_EACH (packet, list_node, &miss->packets) {
3519 stats->tcp_flags |= packet_get_tcp_flags(packet, &miss->flow);
3520 stats->n_bytes += packet->size;
3524 facet = facet_lookup_valid(ofproto, &miss->flow);
3526 struct flow_wildcards wc;
3527 struct rule_dpif *rule;
3528 struct xlate_out xout;
3529 struct xlate_in xin;
3531 flow_wildcards_init_catchall(&wc);
3532 rule = rule_dpif_lookup(ofproto, &miss->flow, &wc);
3533 rule_credit_stats(rule, stats);
3535 xlate_in_init(&xin, ofproto, &miss->flow, rule, stats->tcp_flags,
3537 xin.resubmit_stats = stats;
3538 xin.may_learn = true;
3539 xlate_actions(&xin, &xout);
3540 flow_wildcards_or(&xout.wc, &xout.wc, &wc);
3542 /* There does not exist a bijection between 'struct flow' and datapath
3543 * flow keys with fitness ODP_FIT_TO_LITTLE. This breaks a fundamental
3544 * assumption used throughout the facet and subfacet handling code.
3545 * Since we have to handle these misses in userspace anyway, we simply
3546 * skip facet creation, avoiding the problem altogether. */
3547 if (miss->key_fitness == ODP_FIT_TOO_LITTLE
3548 || !flow_miss_should_make_facet(miss, &xout.wc)) {
3549 handle_flow_miss_without_facet(rule, &xout, miss, ops, n_ops);
3553 facet = facet_create(miss, rule, &xout, stats);
3556 handle_flow_miss_with_facet(miss, facet, now, stats, ops, n_ops);
3559 static struct drop_key *
3560 drop_key_lookup(const struct dpif_backer *backer, const struct nlattr *key,
3563 struct drop_key *drop_key;
3565 HMAP_FOR_EACH_WITH_HASH (drop_key, hmap_node, hash_bytes(key, key_len, 0),
3566 &backer->drop_keys) {
3567 if (drop_key->key_len == key_len
3568 && !memcmp(drop_key->key, key, key_len)) {
3576 drop_key_clear(struct dpif_backer *backer)
3578 static struct vlog_rate_limit rl = VLOG_RATE_LIMIT_INIT(1, 15);
3579 struct drop_key *drop_key, *next;
3581 HMAP_FOR_EACH_SAFE (drop_key, next, hmap_node, &backer->drop_keys) {
3584 error = dpif_flow_del(backer->dpif, drop_key->key, drop_key->key_len,
3586 if (error && !VLOG_DROP_WARN(&rl)) {
3587 struct ds ds = DS_EMPTY_INITIALIZER;
3588 odp_flow_key_format(drop_key->key, drop_key->key_len, &ds);
3589 VLOG_WARN("Failed to delete drop key (%s) (%s)", strerror(error),
3594 hmap_remove(&backer->drop_keys, &drop_key->hmap_node);
3595 free(drop_key->key);
3600 /* Given a datpath, packet, and flow metadata ('backer', 'packet', and 'key'
3601 * respectively), populates 'flow' with the result of odp_flow_key_to_flow().
3602 * Optionally, if nonnull, populates 'fitnessp' with the fitness of 'flow' as
3603 * returned by odp_flow_key_to_flow(). Also, optionally populates 'ofproto'
3604 * with the ofproto_dpif, and 'odp_in_port' with the datapath in_port, that
3605 * 'packet' ingressed.
3607 * If 'ofproto' is nonnull, requires 'flow''s in_port to exist. Otherwise sets
3608 * 'flow''s in_port to OFPP_NONE.
3610 * This function does post-processing on data returned from
3611 * odp_flow_key_to_flow() to help make VLAN splinters transparent to the rest
3612 * of the upcall processing logic. In particular, if the extracted in_port is
3613 * a VLAN splinter port, it replaces flow->in_port by the "real" port, sets
3614 * flow->vlan_tci correctly for the VLAN of the VLAN splinter port, and pushes
3615 * a VLAN header onto 'packet' (if it is nonnull).
3617 * Similarly, this function also includes some logic to help with tunnels. It
3618 * may modify 'flow' as necessary to make the tunneling implementation
3619 * transparent to the upcall processing logic.
3621 * Returns 0 if successful, ENODEV if the parsed flow has no associated ofport,
3622 * or some other positive errno if there are other problems. */
3624 ofproto_receive(const struct dpif_backer *backer, struct ofpbuf *packet,
3625 const struct nlattr *key, size_t key_len,
3626 struct flow *flow, enum odp_key_fitness *fitnessp,
3627 struct ofproto_dpif **ofproto, odp_port_t *odp_in_port)
3629 const struct ofport_dpif *port;
3630 enum odp_key_fitness fitness;
3633 fitness = odp_flow_key_to_flow(key, key_len, flow);
3634 if (fitness == ODP_FIT_ERROR) {
3640 *odp_in_port = flow->in_port.odp_port;
3643 port = (tnl_port_should_receive(flow)
3644 ? ofport_dpif_cast(tnl_port_receive(flow))
3645 : odp_port_to_ofport(backer, flow->in_port.odp_port));
3646 flow->in_port.ofp_port = port ? port->up.ofp_port : OFPP_NONE;
3651 /* XXX: Since the tunnel module is not scoped per backer, for a tunnel port
3652 * it's theoretically possible that we'll receive an ofport belonging to an
3653 * entirely different datapath. In practice, this can't happen because no
3654 * platforms has two separate datapaths which each support tunneling. */
3655 ovs_assert(ofproto_dpif_cast(port->up.ofproto)->backer == backer);
3657 if (vsp_adjust_flow(ofproto_dpif_cast(port->up.ofproto), flow)) {
3659 /* Make the packet resemble the flow, so that it gets sent to
3660 * an OpenFlow controller properly, so that it looks correct
3661 * for sFlow, and so that flow_extract() will get the correct
3662 * vlan_tci if it is called on 'packet'.
3664 * The allocated space inside 'packet' probably also contains
3665 * 'key', that is, both 'packet' and 'key' are probably part of
3666 * a struct dpif_upcall (see the large comment on that
3667 * structure definition), so pushing data on 'packet' is in
3668 * general not a good idea since it could overwrite 'key' or
3669 * free it as a side effect. However, it's OK in this special
3670 * case because we know that 'packet' is inside a Netlink
3671 * attribute: pushing 4 bytes will just overwrite the 4-byte
3672 * "struct nlattr", which is fine since we don't need that
3673 * header anymore. */
3674 eth_push_vlan(packet, flow->vlan_tci);
3676 /* We can't reproduce 'key' from 'flow'. */
3677 fitness = fitness == ODP_FIT_PERFECT ? ODP_FIT_TOO_MUCH : fitness;
3682 *ofproto = ofproto_dpif_cast(port->up.ofproto);
3687 *fitnessp = fitness;
3693 handle_miss_upcalls(struct dpif_backer *backer, struct dpif_upcall *upcalls,
3696 struct dpif_upcall *upcall;
3697 struct flow_miss *miss;
3698 struct flow_miss misses[FLOW_MISS_MAX_BATCH];
3699 struct flow_miss_op flow_miss_ops[FLOW_MISS_MAX_BATCH * 2];
3700 struct dpif_op *dpif_ops[FLOW_MISS_MAX_BATCH * 2];
3710 /* Construct the to-do list.
3712 * This just amounts to extracting the flow from each packet and sticking
3713 * the packets that have the same flow in the same "flow_miss" structure so
3714 * that we can process them together. */
3717 for (upcall = upcalls; upcall < &upcalls[n_upcalls]; upcall++) {
3718 struct flow_miss *miss = &misses[n_misses];
3719 struct flow_miss *existing_miss;
3720 struct ofproto_dpif *ofproto;
3721 odp_port_t odp_in_port;
3726 error = ofproto_receive(backer, upcall->packet, upcall->key,
3727 upcall->key_len, &flow, &miss->key_fitness,
3728 &ofproto, &odp_in_port);
3729 if (error == ENODEV) {
3730 struct drop_key *drop_key;
3732 /* Received packet on datapath port for which we couldn't
3733 * associate an ofproto. This can happen if a port is removed
3734 * while traffic is being received. Print a rate-limited message
3735 * in case it happens frequently. Install a drop flow so
3736 * that future packets of the flow are inexpensively dropped
3738 VLOG_INFO_RL(&rl, "received packet on unassociated datapath port "
3739 "%"PRIu32, odp_in_port);
3741 drop_key = drop_key_lookup(backer, upcall->key, upcall->key_len);
3743 drop_key = xmalloc(sizeof *drop_key);
3744 drop_key->key = xmemdup(upcall->key, upcall->key_len);
3745 drop_key->key_len = upcall->key_len;
3747 hmap_insert(&backer->drop_keys, &drop_key->hmap_node,
3748 hash_bytes(drop_key->key, drop_key->key_len, 0));
3749 dpif_flow_put(backer->dpif, DPIF_FP_CREATE | DPIF_FP_MODIFY,
3750 drop_key->key, drop_key->key_len,
3751 NULL, 0, NULL, 0, NULL);
3759 ofproto->n_missed++;
3760 flow_extract(upcall->packet, flow.skb_priority, flow.skb_mark,
3761 &flow.tunnel, &flow.in_port, &miss->flow);
3763 /* Add other packets to a to-do list. */
3764 hash = flow_hash(&miss->flow, 0);
3765 existing_miss = flow_miss_find(&todo, ofproto, &miss->flow, hash);
3766 if (!existing_miss) {
3767 hmap_insert(&todo, &miss->hmap_node, hash);
3768 miss->ofproto = ofproto;
3769 miss->key = upcall->key;
3770 miss->key_len = upcall->key_len;
3771 miss->upcall_type = upcall->type;
3772 list_init(&miss->packets);
3776 miss = existing_miss;
3778 list_push_back(&miss->packets, &upcall->packet->list_node);
3781 /* Process each element in the to-do list, constructing the set of
3782 * operations to batch. */
3784 HMAP_FOR_EACH (miss, hmap_node, &todo) {
3785 handle_flow_miss(miss, flow_miss_ops, &n_ops);
3787 ovs_assert(n_ops <= ARRAY_SIZE(flow_miss_ops));
3789 /* Execute batch. */
3790 for (i = 0; i < n_ops; i++) {
3791 dpif_ops[i] = &flow_miss_ops[i].dpif_op;
3793 dpif_operate(backer->dpif, dpif_ops, n_ops);
3795 for (i = 0; i < n_ops; i++) {
3796 if (dpif_ops[i]->error != 0
3797 && flow_miss_ops[i].dpif_op.type == DPIF_OP_FLOW_PUT
3798 && flow_miss_ops[i].subfacet) {
3799 struct subfacet *subfacet = flow_miss_ops[i].subfacet;
3801 COVERAGE_INC(subfacet_install_fail);
3803 subfacet->path = SF_NOT_INSTALLED;
3807 if (flow_miss_ops[i].xout_garbage) {
3808 xlate_out_uninit(&flow_miss_ops[i].xout);
3811 hmap_destroy(&todo);
3814 static enum { SFLOW_UPCALL, MISS_UPCALL, BAD_UPCALL, FLOW_SAMPLE_UPCALL,
3816 classify_upcall(const struct dpif_upcall *upcall)
3818 size_t userdata_len;
3819 union user_action_cookie cookie;
3821 /* First look at the upcall type. */
3822 switch (upcall->type) {
3823 case DPIF_UC_ACTION:
3829 case DPIF_N_UC_TYPES:
3831 VLOG_WARN_RL(&rl, "upcall has unexpected type %"PRIu32, upcall->type);
3835 /* "action" upcalls need a closer look. */
3836 if (!upcall->userdata) {
3837 VLOG_WARN_RL(&rl, "action upcall missing cookie");
3840 userdata_len = nl_attr_get_size(upcall->userdata);
3841 if (userdata_len < sizeof cookie.type
3842 || userdata_len > sizeof cookie) {
3843 VLOG_WARN_RL(&rl, "action upcall cookie has unexpected size %zu",
3847 memset(&cookie, 0, sizeof cookie);
3848 memcpy(&cookie, nl_attr_get(upcall->userdata), userdata_len);
3849 if (userdata_len == sizeof cookie.sflow
3850 && cookie.type == USER_ACTION_COOKIE_SFLOW) {
3851 return SFLOW_UPCALL;
3852 } else if (userdata_len == sizeof cookie.slow_path
3853 && cookie.type == USER_ACTION_COOKIE_SLOW_PATH) {
3855 } else if (userdata_len == sizeof cookie.flow_sample
3856 && cookie.type == USER_ACTION_COOKIE_FLOW_SAMPLE) {
3857 return FLOW_SAMPLE_UPCALL;
3858 } else if (userdata_len == sizeof cookie.ipfix
3859 && cookie.type == USER_ACTION_COOKIE_IPFIX) {
3860 return IPFIX_UPCALL;
3862 VLOG_WARN_RL(&rl, "invalid user cookie of type %"PRIu16
3863 " and size %zu", cookie.type, userdata_len);
3869 handle_sflow_upcall(struct dpif_backer *backer,
3870 const struct dpif_upcall *upcall)
3872 struct ofproto_dpif *ofproto;
3873 union user_action_cookie cookie;
3875 odp_port_t odp_in_port;
3877 if (ofproto_receive(backer, upcall->packet, upcall->key, upcall->key_len,
3878 &flow, NULL, &ofproto, &odp_in_port)
3879 || !ofproto->sflow) {
3883 memset(&cookie, 0, sizeof cookie);
3884 memcpy(&cookie, nl_attr_get(upcall->userdata), sizeof cookie.sflow);
3885 dpif_sflow_received(ofproto->sflow, upcall->packet, &flow,
3886 odp_in_port, &cookie);
3890 handle_flow_sample_upcall(struct dpif_backer *backer,
3891 const struct dpif_upcall *upcall)
3893 struct ofproto_dpif *ofproto;
3894 union user_action_cookie cookie;
3897 if (ofproto_receive(backer, upcall->packet, upcall->key, upcall->key_len,
3898 &flow, NULL, &ofproto, NULL)
3899 || !ofproto->ipfix) {
3903 memset(&cookie, 0, sizeof cookie);
3904 memcpy(&cookie, nl_attr_get(upcall->userdata), sizeof cookie.flow_sample);
3906 /* The flow reflects exactly the contents of the packet. Sample
3907 * the packet using it. */
3908 dpif_ipfix_flow_sample(ofproto->ipfix, upcall->packet, &flow,
3909 cookie.flow_sample.collector_set_id,
3910 cookie.flow_sample.probability,
3911 cookie.flow_sample.obs_domain_id,
3912 cookie.flow_sample.obs_point_id);
3916 handle_ipfix_upcall(struct dpif_backer *backer,
3917 const struct dpif_upcall *upcall)
3919 struct ofproto_dpif *ofproto;
3922 if (ofproto_receive(backer, upcall->packet, upcall->key, upcall->key_len,
3923 &flow, NULL, &ofproto, NULL)
3924 || !ofproto->ipfix) {
3928 /* The flow reflects exactly the contents of the packet. Sample
3929 * the packet using it. */
3930 dpif_ipfix_bridge_sample(ofproto->ipfix, upcall->packet, &flow);
3934 handle_upcalls(struct dpif_backer *backer, unsigned int max_batch)
3936 struct dpif_upcall misses[FLOW_MISS_MAX_BATCH];
3937 struct ofpbuf miss_bufs[FLOW_MISS_MAX_BATCH];
3938 uint64_t miss_buf_stubs[FLOW_MISS_MAX_BATCH][4096 / 8];
3943 ovs_assert(max_batch <= FLOW_MISS_MAX_BATCH);
3946 for (n_processed = 0; n_processed < max_batch; n_processed++) {
3947 struct dpif_upcall *upcall = &misses[n_misses];
3948 struct ofpbuf *buf = &miss_bufs[n_misses];
3951 ofpbuf_use_stub(buf, miss_buf_stubs[n_misses],
3952 sizeof miss_buf_stubs[n_misses]);
3953 error = dpif_recv(backer->dpif, upcall, buf);
3959 switch (classify_upcall(upcall)) {
3961 /* Handle it later. */
3966 handle_sflow_upcall(backer, upcall);
3970 case FLOW_SAMPLE_UPCALL:
3971 handle_flow_sample_upcall(backer, upcall);
3976 handle_ipfix_upcall(backer, upcall);
3986 /* Handle deferred MISS_UPCALL processing. */
3987 handle_miss_upcalls(backer, misses, n_misses);
3988 for (i = 0; i < n_misses; i++) {
3989 ofpbuf_uninit(&miss_bufs[i]);
3995 /* Flow expiration. */
3997 static int subfacet_max_idle(const struct dpif_backer *);
3998 static void update_stats(struct dpif_backer *);
3999 static void rule_expire(struct rule_dpif *);
4000 static void expire_subfacets(struct dpif_backer *, int dp_max_idle);
4002 /* This function is called periodically by run(). Its job is to collect
4003 * updates for the flows that have been installed into the datapath, most
4004 * importantly when they last were used, and then use that information to
4005 * expire flows that have not been used recently.
4007 * Returns the number of milliseconds after which it should be called again. */
4009 expire(struct dpif_backer *backer)
4011 struct ofproto_dpif *ofproto;
4015 /* Periodically clear out the drop keys in an effort to keep them
4016 * relatively few. */
4017 drop_key_clear(backer);
4019 /* Update stats for each flow in the backer. */
4020 update_stats(backer);
4022 n_subfacets = hmap_count(&backer->subfacets);
4024 struct subfacet *subfacet;
4025 long long int total, now;
4029 HMAP_FOR_EACH (subfacet, hmap_node, &backer->subfacets) {
4030 total += now - subfacet->created;
4032 backer->avg_subfacet_life += total / n_subfacets;
4034 backer->avg_subfacet_life /= 2;
4036 backer->avg_n_subfacet += n_subfacets;
4037 backer->avg_n_subfacet /= 2;
4039 backer->max_n_subfacet = MAX(backer->max_n_subfacet, n_subfacets);
4041 max_idle = subfacet_max_idle(backer);
4042 expire_subfacets(backer, max_idle);
4044 HMAP_FOR_EACH (ofproto, all_ofproto_dpifs_node, &all_ofproto_dpifs) {
4045 struct rule *rule, *next_rule;
4047 if (ofproto->backer != backer) {
4051 /* Expire OpenFlow flows whose idle_timeout or hard_timeout
4053 LIST_FOR_EACH_SAFE (rule, next_rule, expirable,
4054 &ofproto->up.expirable) {
4055 rule_expire(rule_dpif_cast(rule));
4058 /* All outstanding data in existing flows has been accounted, so it's a
4059 * good time to do bond rebalancing. */
4060 if (ofproto->has_bonded_bundles) {
4061 struct ofbundle *bundle;
4063 HMAP_FOR_EACH (bundle, hmap_node, &ofproto->bundles) {
4065 bond_rebalance(bundle->bond, &backer->revalidate_set);
4071 return MIN(max_idle, 1000);
4074 /* Updates flow table statistics given that the datapath just reported 'stats'
4075 * as 'subfacet''s statistics. */
4077 update_subfacet_stats(struct subfacet *subfacet,
4078 const struct dpif_flow_stats *stats)
4080 struct facet *facet = subfacet->facet;
4081 struct ofproto_dpif *ofproto = ofproto_dpif_cast(facet->rule->up.ofproto);
4082 struct dpif_flow_stats diff;
4084 diff.tcp_flags = stats->tcp_flags;
4085 diff.used = stats->used;
4087 if (stats->n_packets >= subfacet->dp_packet_count) {
4088 diff.n_packets = stats->n_packets - subfacet->dp_packet_count;
4090 VLOG_WARN_RL(&rl, "unexpected packet count from the datapath");
4094 if (stats->n_bytes >= subfacet->dp_byte_count) {
4095 diff.n_bytes = stats->n_bytes - subfacet->dp_byte_count;
4097 VLOG_WARN_RL(&rl, "unexpected byte count from datapath");
4101 ofproto->n_hit += diff.n_packets;
4102 subfacet->dp_packet_count = stats->n_packets;
4103 subfacet->dp_byte_count = stats->n_bytes;
4104 subfacet_update_stats(subfacet, &diff);
4106 if (facet->accounted_bytes < facet->byte_count) {
4108 facet_account(facet);
4109 facet->accounted_bytes = facet->byte_count;
4113 /* 'key' with length 'key_len' bytes is a flow in 'dpif' that we know nothing
4114 * about, or a flow that shouldn't be installed but was anyway. Delete it. */
4116 delete_unexpected_flow(struct dpif_backer *backer,
4117 const struct nlattr *key, size_t key_len)
4119 if (!VLOG_DROP_WARN(&rl)) {
4123 odp_flow_key_format(key, key_len, &s);
4124 VLOG_WARN("unexpected flow: %s", ds_cstr(&s));
4128 COVERAGE_INC(facet_unexpected);
4129 dpif_flow_del(backer->dpif, key, key_len, NULL);
4132 /* Update 'packet_count', 'byte_count', and 'used' members of installed facets.
4134 * This function also pushes statistics updates to rules which each facet
4135 * resubmits into. Generally these statistics will be accurate. However, if a
4136 * facet changes the rule it resubmits into at some time in between
4137 * update_stats() runs, it is possible that statistics accrued to the
4138 * old rule will be incorrectly attributed to the new rule. This could be
4139 * avoided by calling update_stats() whenever rules are created or
4140 * deleted. However, the performance impact of making so many calls to the
4141 * datapath do not justify the benefit of having perfectly accurate statistics.
4143 * In addition, this function maintains per ofproto flow hit counts. The patch
4144 * port is not treated specially. e.g. A packet ingress from br0 patched into
4145 * br1 will increase the hit count of br0 by 1, however, does not affect
4146 * the hit or miss counts of br1.
4149 update_stats(struct dpif_backer *backer)
4151 const struct dpif_flow_stats *stats;
4152 struct dpif_flow_dump dump;
4153 const struct nlattr *key, *mask;
4154 size_t key_len, mask_len;
4156 dpif_flow_dump_start(&dump, backer->dpif);
4157 while (dpif_flow_dump_next(&dump, &key, &key_len,
4158 &mask, &mask_len, NULL, NULL, &stats)) {
4159 struct subfacet *subfacet;
4162 key_hash = odp_flow_key_hash(key, key_len);
4163 subfacet = subfacet_find(backer, key, key_len, key_hash);
4164 switch (subfacet ? subfacet->path : SF_NOT_INSTALLED) {
4166 update_subfacet_stats(subfacet, stats);
4170 /* Stats are updated per-packet. */
4173 case SF_NOT_INSTALLED:
4175 delete_unexpected_flow(backer, key, key_len);
4180 dpif_flow_dump_done(&dump);
4182 update_moving_averages(backer);
4185 /* Calculates and returns the number of milliseconds of idle time after which
4186 * subfacets should expire from the datapath. When a subfacet expires, we fold
4187 * its statistics into its facet, and when a facet's last subfacet expires, we
4188 * fold its statistic into its rule. */
4190 subfacet_max_idle(const struct dpif_backer *backer)
4193 * Idle time histogram.
4195 * Most of the time a switch has a relatively small number of subfacets.
4196 * When this is the case we might as well keep statistics for all of them
4197 * in userspace and to cache them in the kernel datapath for performance as
4200 * As the number of subfacets increases, the memory required to maintain
4201 * statistics about them in userspace and in the kernel becomes
4202 * significant. However, with a large number of subfacets it is likely
4203 * that only a few of them are "heavy hitters" that consume a large amount
4204 * of bandwidth. At this point, only heavy hitters are worth caching in
4205 * the kernel and maintaining in userspaces; other subfacets we can
4208 * The technique used to compute the idle time is to build a histogram with
4209 * N_BUCKETS buckets whose width is BUCKET_WIDTH msecs each. Each subfacet
4210 * that is installed in the kernel gets dropped in the appropriate bucket.
4211 * After the histogram has been built, we compute the cutoff so that only
4212 * the most-recently-used 1% of subfacets (but at least
4213 * flow_eviction_threshold flows) are kept cached. At least
4214 * the most-recently-used bucket of subfacets is kept, so actually an
4215 * arbitrary number of subfacets can be kept in any given expiration run
4216 * (though the next run will delete most of those unless they receive
4219 * This requires a second pass through the subfacets, in addition to the
4220 * pass made by update_stats(), because the former function never looks at
4221 * uninstallable subfacets.
4223 enum { BUCKET_WIDTH = ROUND_UP(100, TIME_UPDATE_INTERVAL) };
4224 enum { N_BUCKETS = 5000 / BUCKET_WIDTH };
4225 int buckets[N_BUCKETS] = { 0 };
4226 int total, subtotal, bucket;
4227 struct subfacet *subfacet;
4231 total = hmap_count(&backer->subfacets);
4232 if (total <= flow_eviction_threshold) {
4233 return N_BUCKETS * BUCKET_WIDTH;
4236 /* Build histogram. */
4238 HMAP_FOR_EACH (subfacet, hmap_node, &backer->subfacets) {
4239 long long int idle = now - subfacet->used;
4240 int bucket = (idle <= 0 ? 0
4241 : idle >= BUCKET_WIDTH * N_BUCKETS ? N_BUCKETS - 1
4242 : (unsigned int) idle / BUCKET_WIDTH);
4246 /* Find the first bucket whose flows should be expired. */
4247 subtotal = bucket = 0;
4249 subtotal += buckets[bucket++];
4250 } while (bucket < N_BUCKETS &&
4251 subtotal < MAX(flow_eviction_threshold, total / 100));
4253 if (VLOG_IS_DBG_ENABLED()) {
4257 ds_put_cstr(&s, "keep");
4258 for (i = 0; i < N_BUCKETS; i++) {
4260 ds_put_cstr(&s, ", drop");
4263 ds_put_format(&s, " %d:%d", i * BUCKET_WIDTH, buckets[i]);
4266 VLOG_INFO("%s (msec:count)", ds_cstr(&s));
4270 return bucket * BUCKET_WIDTH;
4274 expire_subfacets(struct dpif_backer *backer, int dp_max_idle)
4276 /* Cutoff time for most flows. */
4277 long long int normal_cutoff = time_msec() - dp_max_idle;
4279 /* We really want to keep flows for special protocols around, so use a more
4280 * conservative cutoff. */
4281 long long int special_cutoff = time_msec() - 10000;
4283 struct subfacet *subfacet, *next_subfacet;
4284 struct subfacet *batch[SUBFACET_DESTROY_MAX_BATCH];
4288 HMAP_FOR_EACH_SAFE (subfacet, next_subfacet, hmap_node,
4289 &backer->subfacets) {
4290 long long int cutoff;
4292 cutoff = (subfacet->facet->xout.slow & (SLOW_CFM | SLOW_BFD | SLOW_LACP
4296 if (subfacet->used < cutoff) {
4297 if (subfacet->path != SF_NOT_INSTALLED) {
4298 batch[n_batch++] = subfacet;
4299 if (n_batch >= SUBFACET_DESTROY_MAX_BATCH) {
4300 subfacet_destroy_batch(backer, batch, n_batch);
4304 subfacet_destroy(subfacet);
4310 subfacet_destroy_batch(backer, batch, n_batch);
4314 /* If 'rule' is an OpenFlow rule, that has expired according to OpenFlow rules,
4315 * then delete it entirely. */
4317 rule_expire(struct rule_dpif *rule)
4319 struct facet *facet, *next_facet;
4323 if (rule->up.pending) {
4324 /* We'll have to expire it later. */
4328 /* Has 'rule' expired? */
4330 if (rule->up.hard_timeout
4331 && now > rule->up.modified + rule->up.hard_timeout * 1000) {
4332 reason = OFPRR_HARD_TIMEOUT;
4333 } else if (rule->up.idle_timeout
4334 && now > rule->up.used + rule->up.idle_timeout * 1000) {
4335 reason = OFPRR_IDLE_TIMEOUT;
4340 COVERAGE_INC(ofproto_dpif_expired);
4342 /* Update stats. (This is a no-op if the rule expired due to an idle
4343 * timeout, because that only happens when the rule has no facets left.) */
4344 LIST_FOR_EACH_SAFE (facet, next_facet, list_node, &rule->facets) {
4345 facet_remove(facet);
4348 /* Get rid of the rule. */
4349 ofproto_rule_expire(&rule->up, reason);
4354 /* Creates and returns a new facet based on 'miss'.
4356 * The caller must already have determined that no facet with an identical
4357 * 'miss->flow' exists in 'miss->ofproto'.
4359 * 'rule' and 'xout' must have been created based on 'miss'.
4361 * 'facet'' statistics are initialized based on 'stats'.
4363 * The facet will initially have no subfacets. The caller should create (at
4364 * least) one subfacet with subfacet_create(). */
4365 static struct facet *
4366 facet_create(const struct flow_miss *miss, struct rule_dpif *rule,
4367 struct xlate_out *xout, struct dpif_flow_stats *stats)
4369 struct ofproto_dpif *ofproto = miss->ofproto;
4370 struct facet *facet;
4373 facet = xzalloc(sizeof *facet);
4374 facet->packet_count = facet->prev_packet_count = stats->n_packets;
4375 facet->byte_count = facet->prev_byte_count = stats->n_bytes;
4376 facet->tcp_flags = stats->tcp_flags;
4377 facet->used = stats->used;
4378 facet->flow = miss->flow;
4379 facet->learn_rl = time_msec() + 500;
4382 list_push_back(&facet->rule->facets, &facet->list_node);
4383 list_init(&facet->subfacets);
4384 netflow_flow_init(&facet->nf_flow);
4385 netflow_flow_update_time(ofproto->netflow, &facet->nf_flow, facet->used);
4387 xlate_out_copy(&facet->xout, xout);
4389 match_init(&match, &facet->flow, &facet->xout.wc);
4390 cls_rule_init(&facet->cr, &match, OFP_DEFAULT_PRIORITY);
4391 classifier_insert(&ofproto->facets, &facet->cr);
4393 facet->nf_flow.output_iface = facet->xout.nf_output_iface;
4399 facet_free(struct facet *facet)
4402 xlate_out_uninit(&facet->xout);
4407 /* Executes, within 'ofproto', the 'n_actions' actions in 'actions' on
4408 * 'packet', which arrived on 'in_port'. */
4410 execute_odp_actions(struct ofproto_dpif *ofproto, const struct flow *flow,
4411 const struct nlattr *odp_actions, size_t actions_len,
4412 struct ofpbuf *packet)
4414 struct odputil_keybuf keybuf;
4418 ofpbuf_use_stack(&key, &keybuf, sizeof keybuf);
4419 odp_flow_key_from_flow(&key, flow,
4420 ofp_port_to_odp_port(ofproto, flow->in_port.ofp_port));
4422 error = dpif_execute(ofproto->backer->dpif, key.data, key.size,
4423 odp_actions, actions_len, packet);
4427 /* Remove 'facet' from its ofproto and free up the associated memory:
4429 * - If 'facet' was installed in the datapath, uninstalls it and updates its
4430 * rule's statistics, via subfacet_uninstall().
4432 * - Removes 'facet' from its rule and from ofproto->facets.
4435 facet_remove(struct facet *facet)
4437 struct ofproto_dpif *ofproto = ofproto_dpif_cast(facet->rule->up.ofproto);
4438 struct subfacet *subfacet, *next_subfacet;
4440 ovs_assert(!list_is_empty(&facet->subfacets));
4442 /* First uninstall all of the subfacets to get final statistics. */
4443 LIST_FOR_EACH (subfacet, list_node, &facet->subfacets) {
4444 subfacet_uninstall(subfacet);
4447 /* Flush the final stats to the rule.
4449 * This might require us to have at least one subfacet around so that we
4450 * can use its actions for accounting in facet_account(), which is why we
4451 * have uninstalled but not yet destroyed the subfacets. */
4452 facet_flush_stats(facet);
4454 /* Now we're really all done so destroy everything. */
4455 LIST_FOR_EACH_SAFE (subfacet, next_subfacet, list_node,
4456 &facet->subfacets) {
4457 subfacet_destroy__(subfacet);
4459 classifier_remove(&ofproto->facets, &facet->cr);
4460 cls_rule_destroy(&facet->cr);
4461 list_remove(&facet->list_node);
4465 /* Feed information from 'facet' back into the learning table to keep it in
4466 * sync with what is actually flowing through the datapath. */
4468 facet_learn(struct facet *facet)
4470 long long int now = time_msec();
4472 if (!facet->xout.has_fin_timeout && now < facet->learn_rl) {
4476 facet->learn_rl = now + 500;
4478 if (!facet->xout.has_learn
4479 && !facet->xout.has_normal
4480 && (!facet->xout.has_fin_timeout
4481 || !(facet->tcp_flags & (TCP_FIN | TCP_RST)))) {
4485 facet_push_stats(facet, true);
4489 facet_account(struct facet *facet)
4491 struct ofproto_dpif *ofproto = ofproto_dpif_cast(facet->rule->up.ofproto);
4492 const struct nlattr *a;
4497 if (!facet->xout.has_normal || !ofproto->has_bonded_bundles) {
4500 n_bytes = facet->byte_count - facet->accounted_bytes;
4502 /* This loop feeds byte counters to bond_account() for rebalancing to use
4503 * as a basis. We also need to track the actual VLAN on which the packet
4504 * is going to be sent to ensure that it matches the one passed to
4505 * bond_choose_output_slave(). (Otherwise, we will account to the wrong
4508 * We use the actions from an arbitrary subfacet because they should all
4509 * be equally valid for our purpose. */
4510 vlan_tci = facet->flow.vlan_tci;
4511 NL_ATTR_FOR_EACH_UNSAFE (a, left, facet->xout.odp_actions.data,
4512 facet->xout.odp_actions.size) {
4513 const struct ovs_action_push_vlan *vlan;
4514 struct ofport_dpif *port;
4516 switch (nl_attr_type(a)) {
4517 case OVS_ACTION_ATTR_OUTPUT:
4518 port = get_odp_port(ofproto, nl_attr_get_odp_port(a));
4519 if (port && port->bundle && port->bundle->bond) {
4520 bond_account(port->bundle->bond, &facet->flow,
4521 vlan_tci_to_vid(vlan_tci), n_bytes);
4525 case OVS_ACTION_ATTR_POP_VLAN:
4526 vlan_tci = htons(0);
4529 case OVS_ACTION_ATTR_PUSH_VLAN:
4530 vlan = nl_attr_get(a);
4531 vlan_tci = vlan->vlan_tci;
4537 /* Returns true if the only action for 'facet' is to send to the controller.
4538 * (We don't report NetFlow expiration messages for such facets because they
4539 * are just part of the control logic for the network, not real traffic). */
4541 facet_is_controller_flow(struct facet *facet)
4544 const struct rule *rule = &facet->rule->up;
4545 const struct ofpact *ofpacts = rule->ofpacts;
4546 size_t ofpacts_len = rule->ofpacts_len;
4548 if (ofpacts_len > 0 &&
4549 ofpacts->type == OFPACT_CONTROLLER &&
4550 ofpact_next(ofpacts) >= ofpact_end(ofpacts, ofpacts_len)) {
4557 /* Folds all of 'facet''s statistics into its rule. Also updates the
4558 * accounting ofhook and emits a NetFlow expiration if appropriate. All of
4559 * 'facet''s statistics in the datapath should have been zeroed and folded into
4560 * its packet and byte counts before this function is called. */
4562 facet_flush_stats(struct facet *facet)
4564 struct ofproto_dpif *ofproto = ofproto_dpif_cast(facet->rule->up.ofproto);
4565 struct subfacet *subfacet;
4567 LIST_FOR_EACH (subfacet, list_node, &facet->subfacets) {
4568 ovs_assert(!subfacet->dp_byte_count);
4569 ovs_assert(!subfacet->dp_packet_count);
4572 facet_push_stats(facet, false);
4573 if (facet->accounted_bytes < facet->byte_count) {
4574 facet_account(facet);
4575 facet->accounted_bytes = facet->byte_count;
4578 if (ofproto->netflow && !facet_is_controller_flow(facet)) {
4579 struct ofexpired expired;
4580 expired.flow = facet->flow;
4581 expired.packet_count = facet->packet_count;
4582 expired.byte_count = facet->byte_count;
4583 expired.used = facet->used;
4584 netflow_expire(ofproto->netflow, &facet->nf_flow, &expired);
4587 /* Reset counters to prevent double counting if 'facet' ever gets
4589 facet_reset_counters(facet);
4591 netflow_flow_clear(&facet->nf_flow);
4592 facet->tcp_flags = 0;
4595 /* Searches 'ofproto''s table of facets for one which would be responsible for
4596 * 'flow'. Returns it if found, otherwise a null pointer.
4598 * The returned facet might need revalidation; use facet_lookup_valid()
4599 * instead if that is important. */
4600 static struct facet *
4601 facet_find(struct ofproto_dpif *ofproto, const struct flow *flow)
4603 struct cls_rule *cr = classifier_lookup(&ofproto->facets, flow, NULL);
4604 return cr ? CONTAINER_OF(cr, struct facet, cr) : NULL;
4607 /* Searches 'ofproto''s table of facets for one capable that covers
4608 * 'flow'. Returns it if found, otherwise a null pointer.
4610 * The returned facet is guaranteed to be valid. */
4611 static struct facet *
4612 facet_lookup_valid(struct ofproto_dpif *ofproto, const struct flow *flow)
4614 struct facet *facet;
4616 facet = facet_find(ofproto, flow);
4618 && (ofproto->backer->need_revalidate
4619 || tag_set_intersects(&ofproto->backer->revalidate_set,
4621 && !facet_revalidate(facet)) {
4629 facet_check_consistency(struct facet *facet)
4631 static struct vlog_rate_limit rl = VLOG_RATE_LIMIT_INIT(1, 15);
4633 struct ofproto_dpif *ofproto = ofproto_dpif_cast(facet->rule->up.ofproto);
4635 struct xlate_out xout;
4636 struct xlate_in xin;
4638 struct rule_dpif *rule;
4641 /* Check the rule for consistency. */
4642 rule = rule_dpif_lookup(ofproto, &facet->flow, NULL);
4643 if (rule != facet->rule) {
4644 if (!VLOG_DROP_WARN(&rl)) {
4645 struct ds s = DS_EMPTY_INITIALIZER;
4647 flow_format(&s, &facet->flow);
4648 ds_put_format(&s, ": facet associated with wrong rule (was "
4649 "table=%"PRIu8",", facet->rule->up.table_id);
4650 cls_rule_format(&facet->rule->up.cr, &s);
4651 ds_put_format(&s, ") (should have been table=%"PRIu8",",
4653 cls_rule_format(&rule->up.cr, &s);
4654 ds_put_char(&s, ')');
4656 VLOG_WARN("%s", ds_cstr(&s));
4662 /* Check the datapath actions for consistency. */
4663 xlate_in_init(&xin, ofproto, &facet->flow, rule, 0, NULL);
4664 xlate_actions(&xin, &xout);
4666 ok = ofpbuf_equal(&facet->xout.odp_actions, &xout.odp_actions)
4667 && facet->xout.slow == xout.slow;
4668 if (!ok && !VLOG_DROP_WARN(&rl)) {
4669 struct ds s = DS_EMPTY_INITIALIZER;
4671 flow_format(&s, &facet->flow);
4672 ds_put_cstr(&s, ": inconsistency in facet");
4674 if (!ofpbuf_equal(&facet->xout.odp_actions, &xout.odp_actions)) {
4675 ds_put_cstr(&s, " (actions were: ");
4676 format_odp_actions(&s, facet->xout.odp_actions.data,
4677 facet->xout.odp_actions.size);
4678 ds_put_cstr(&s, ") (correct actions: ");
4679 format_odp_actions(&s, xout.odp_actions.data,
4680 xout.odp_actions.size);
4681 ds_put_char(&s, ')');
4684 if (facet->xout.slow != xout.slow) {
4685 ds_put_format(&s, " slow path incorrect. should be %d", xout.slow);
4688 VLOG_WARN("%s", ds_cstr(&s));
4691 xlate_out_uninit(&xout);
4696 /* Re-searches the classifier for 'facet':
4698 * - If the rule found is different from 'facet''s current rule, moves
4699 * 'facet' to the new rule and recompiles its actions.
4701 * - If the rule found is the same as 'facet''s current rule, leaves 'facet'
4702 * where it is and recompiles its actions anyway.
4704 * - If any of 'facet''s subfacets correspond to a new flow according to
4705 * ofproto_receive(), 'facet' is removed.
4707 * Returns true if 'facet' is still valid. False if 'facet' was removed. */
4709 facet_revalidate(struct facet *facet)
4711 struct ofproto_dpif *ofproto = ofproto_dpif_cast(facet->rule->up.ofproto);
4712 struct rule_dpif *new_rule;
4713 struct subfacet *subfacet;
4714 struct flow_wildcards wc;
4715 struct xlate_out xout;
4716 struct xlate_in xin;
4718 COVERAGE_INC(facet_revalidate);
4720 /* Check that child subfacets still correspond to this facet. Tunnel
4721 * configuration changes could cause a subfacet's OpenFlow in_port to
4723 LIST_FOR_EACH (subfacet, list_node, &facet->subfacets) {
4724 struct ofproto_dpif *recv_ofproto;
4725 struct flow recv_flow;
4728 error = ofproto_receive(ofproto->backer, NULL, subfacet->key,
4729 subfacet->key_len, &recv_flow, NULL,
4730 &recv_ofproto, NULL);
4732 || recv_ofproto != ofproto
4733 || facet != facet_find(ofproto, &recv_flow)) {
4734 facet_remove(facet);
4739 flow_wildcards_init_catchall(&wc);
4740 new_rule = rule_dpif_lookup(ofproto, &facet->flow, &wc);
4742 /* Calculate new datapath actions.
4744 * We do not modify any 'facet' state yet, because we might need to, e.g.,
4745 * emit a NetFlow expiration and, if so, we need to have the old state
4746 * around to properly compose it. */
4747 xlate_in_init(&xin, ofproto, &facet->flow, new_rule, 0, NULL);
4748 xlate_actions(&xin, &xout);
4749 flow_wildcards_or(&xout.wc, &xout.wc, &wc);
4751 /* A facet's slow path reason should only change under dramatic
4752 * circumstances. Rather than try to update everything, it's simpler to
4753 * remove the facet and start over.
4755 * More importantly, if a facet's wildcards change, it will be relatively
4756 * difficult to figure out if its subfacets still belong to it, and if not
4757 * which facet they may belong to. Again, to avoid the complexity, we
4758 * simply give up instead. */
4759 if (facet->xout.slow != xout.slow
4760 || memcmp(&facet->xout.wc, &xout.wc, sizeof xout.wc)) {
4761 facet_remove(facet);
4762 xlate_out_uninit(&xout);
4766 if (!ofpbuf_equal(&facet->xout.odp_actions, &xout.odp_actions)) {
4767 LIST_FOR_EACH(subfacet, list_node, &facet->subfacets) {
4768 if (subfacet->path == SF_FAST_PATH) {
4769 struct dpif_flow_stats stats;
4771 subfacet_install(subfacet, &xout.odp_actions, &stats);
4772 subfacet_update_stats(subfacet, &stats);
4776 facet_flush_stats(facet);
4778 ofpbuf_clear(&facet->xout.odp_actions);
4779 ofpbuf_put(&facet->xout.odp_actions, xout.odp_actions.data,
4780 xout.odp_actions.size);
4783 /* Update 'facet' now that we've taken care of all the old state. */
4784 facet->xout.tags = xout.tags;
4785 facet->xout.slow = xout.slow;
4786 facet->xout.has_learn = xout.has_learn;
4787 facet->xout.has_normal = xout.has_normal;
4788 facet->xout.has_fin_timeout = xout.has_fin_timeout;
4789 facet->xout.nf_output_iface = xout.nf_output_iface;
4790 facet->xout.mirrors = xout.mirrors;
4791 facet->nf_flow.output_iface = facet->xout.nf_output_iface;
4793 if (facet->rule != new_rule) {
4794 COVERAGE_INC(facet_changed_rule);
4795 list_remove(&facet->list_node);
4796 list_push_back(&new_rule->facets, &facet->list_node);
4797 facet->rule = new_rule;
4798 facet->used = new_rule->up.created;
4799 facet->prev_used = facet->used;
4802 xlate_out_uninit(&xout);
4807 facet_reset_counters(struct facet *facet)
4809 facet->packet_count = 0;
4810 facet->byte_count = 0;
4811 facet->prev_packet_count = 0;
4812 facet->prev_byte_count = 0;
4813 facet->accounted_bytes = 0;
4817 facet_push_stats(struct facet *facet, bool may_learn)
4819 struct dpif_flow_stats stats;
4821 ovs_assert(facet->packet_count >= facet->prev_packet_count);
4822 ovs_assert(facet->byte_count >= facet->prev_byte_count);
4823 ovs_assert(facet->used >= facet->prev_used);
4825 stats.n_packets = facet->packet_count - facet->prev_packet_count;
4826 stats.n_bytes = facet->byte_count - facet->prev_byte_count;
4827 stats.used = facet->used;
4828 stats.tcp_flags = facet->tcp_flags;
4830 if (may_learn || stats.n_packets || facet->used > facet->prev_used) {
4831 struct ofproto_dpif *ofproto =
4832 ofproto_dpif_cast(facet->rule->up.ofproto);
4834 struct ofport_dpif *in_port;
4835 struct xlate_in xin;
4837 facet->prev_packet_count = facet->packet_count;
4838 facet->prev_byte_count = facet->byte_count;
4839 facet->prev_used = facet->used;
4841 in_port = get_ofp_port(ofproto, facet->flow.in_port.ofp_port);
4842 if (in_port && in_port->tnl_port) {
4843 netdev_vport_inc_rx(in_port->up.netdev, &stats);
4846 rule_credit_stats(facet->rule, &stats);
4847 netflow_flow_update_time(ofproto->netflow, &facet->nf_flow,
4849 netflow_flow_update_flags(&facet->nf_flow, facet->tcp_flags);
4850 update_mirror_stats(ofproto, facet->xout.mirrors, stats.n_packets,
4853 xlate_in_init(&xin, ofproto, &facet->flow, facet->rule,
4854 stats.tcp_flags, NULL);
4855 xin.resubmit_stats = &stats;
4856 xin.may_learn = may_learn;
4857 xlate_actions_for_side_effects(&xin);
4862 push_all_stats__(bool run_fast)
4864 static long long int rl = LLONG_MIN;
4865 struct ofproto_dpif *ofproto;
4867 if (time_msec() < rl) {
4871 HMAP_FOR_EACH (ofproto, all_ofproto_dpifs_node, &all_ofproto_dpifs) {
4872 struct cls_cursor cursor;
4873 struct facet *facet;
4875 cls_cursor_init(&cursor, &ofproto->facets, NULL);
4876 CLS_CURSOR_FOR_EACH (facet, cr, &cursor) {
4877 facet_push_stats(facet, false);
4884 rl = time_msec() + 100;
4888 push_all_stats(void)
4890 push_all_stats__(true);
4894 rule_credit_stats(struct rule_dpif *rule, const struct dpif_flow_stats *stats)
4896 rule->packet_count += stats->n_packets;
4897 rule->byte_count += stats->n_bytes;
4898 ofproto_rule_update_used(&rule->up, stats->used);
4903 static struct subfacet *
4904 subfacet_find(struct dpif_backer *backer, const struct nlattr *key,
4905 size_t key_len, uint32_t key_hash)
4907 struct subfacet *subfacet;
4909 HMAP_FOR_EACH_WITH_HASH (subfacet, hmap_node, key_hash,
4910 &backer->subfacets) {
4911 if (subfacet->key_len == key_len
4912 && !memcmp(key, subfacet->key, key_len)) {
4920 /* Searches 'facet' (within 'ofproto') for a subfacet with the specified
4921 * 'key_fitness', 'key', and 'key_len' members in 'miss'. Returns the
4922 * existing subfacet if there is one, otherwise creates and returns a
4924 static struct subfacet *
4925 subfacet_create(struct facet *facet, struct flow_miss *miss,
4928 struct dpif_backer *backer = miss->ofproto->backer;
4929 enum odp_key_fitness key_fitness = miss->key_fitness;
4930 const struct nlattr *key = miss->key;
4931 size_t key_len = miss->key_len;
4933 struct subfacet *subfacet;
4935 key_hash = odp_flow_key_hash(key, key_len);
4937 if (list_is_empty(&facet->subfacets)) {
4938 subfacet = &facet->one_subfacet;
4940 subfacet = subfacet_find(backer, key, key_len, key_hash);
4942 if (subfacet->facet == facet) {
4946 /* This shouldn't happen. */
4947 VLOG_ERR_RL(&rl, "subfacet with wrong facet");
4948 subfacet_destroy(subfacet);
4951 subfacet = xmalloc(sizeof *subfacet);
4954 hmap_insert(&backer->subfacets, &subfacet->hmap_node, key_hash);
4955 list_push_back(&facet->subfacets, &subfacet->list_node);
4956 subfacet->facet = facet;
4957 subfacet->key_fitness = key_fitness;
4958 subfacet->key = xmemdup(key, key_len);
4959 subfacet->key_len = key_len;
4960 subfacet->used = now;
4961 subfacet->created = now;
4962 subfacet->dp_packet_count = 0;
4963 subfacet->dp_byte_count = 0;
4964 subfacet->path = SF_NOT_INSTALLED;
4965 subfacet->backer = backer;
4967 backer->subfacet_add_count++;
4971 /* Uninstalls 'subfacet' from the datapath, if it is installed, removes it from
4972 * its facet within 'ofproto', and frees it. */
4974 subfacet_destroy__(struct subfacet *subfacet)
4976 struct facet *facet = subfacet->facet;
4977 struct ofproto_dpif *ofproto = ofproto_dpif_cast(facet->rule->up.ofproto);
4979 /* Update ofproto stats before uninstall the subfacet. */
4980 ofproto->backer->subfacet_del_count++;
4982 subfacet_uninstall(subfacet);
4983 hmap_remove(&subfacet->backer->subfacets, &subfacet->hmap_node);
4984 list_remove(&subfacet->list_node);
4985 free(subfacet->key);
4986 if (subfacet != &facet->one_subfacet) {
4991 /* Destroys 'subfacet', as with subfacet_destroy__(), and then if this was the
4992 * last remaining subfacet in its facet destroys the facet too. */
4994 subfacet_destroy(struct subfacet *subfacet)
4996 struct facet *facet = subfacet->facet;
4998 if (list_is_singleton(&facet->subfacets)) {
4999 /* facet_remove() needs at least one subfacet (it will remove it). */
5000 facet_remove(facet);
5002 subfacet_destroy__(subfacet);
5007 subfacet_destroy_batch(struct dpif_backer *backer,
5008 struct subfacet **subfacets, int n)
5010 struct dpif_op ops[SUBFACET_DESTROY_MAX_BATCH];
5011 struct dpif_op *opsp[SUBFACET_DESTROY_MAX_BATCH];
5012 struct dpif_flow_stats stats[SUBFACET_DESTROY_MAX_BATCH];
5015 for (i = 0; i < n; i++) {
5016 ops[i].type = DPIF_OP_FLOW_DEL;
5017 ops[i].u.flow_del.key = subfacets[i]->key;
5018 ops[i].u.flow_del.key_len = subfacets[i]->key_len;
5019 ops[i].u.flow_del.stats = &stats[i];
5023 dpif_operate(backer->dpif, opsp, n);
5024 for (i = 0; i < n; i++) {
5025 subfacet_reset_dp_stats(subfacets[i], &stats[i]);
5026 subfacets[i]->path = SF_NOT_INSTALLED;
5027 subfacet_destroy(subfacets[i]);
5032 /* Updates 'subfacet''s datapath flow, setting its actions to 'actions_len'
5033 * bytes of actions in 'actions'. If 'stats' is non-null, statistics counters
5034 * in the datapath will be zeroed and 'stats' will be updated with traffic new
5035 * since 'subfacet' was last updated.
5037 * Returns 0 if successful, otherwise a positive errno value. */
5039 subfacet_install(struct subfacet *subfacet, const struct ofpbuf *odp_actions,
5040 struct dpif_flow_stats *stats)
5042 struct facet *facet = subfacet->facet;
5043 struct ofproto_dpif *ofproto = ofproto_dpif_cast(facet->rule->up.ofproto);
5044 enum subfacet_path path = facet->xout.slow ? SF_SLOW_PATH : SF_FAST_PATH;
5045 const struct nlattr *actions = odp_actions->data;
5046 size_t actions_len = odp_actions->size;
5047 struct odputil_keybuf maskbuf;
5050 uint64_t slow_path_stub[128 / 8];
5051 enum dpif_flow_put_flags flags;
5054 flags = DPIF_FP_CREATE | DPIF_FP_MODIFY;
5056 flags |= DPIF_FP_ZERO_STATS;
5059 if (path == SF_SLOW_PATH) {
5060 compose_slow_path(ofproto, &facet->flow, facet->xout.slow,
5061 slow_path_stub, sizeof slow_path_stub,
5062 &actions, &actions_len);
5065 ofpbuf_use_stack(&mask, &maskbuf, sizeof maskbuf);
5066 odp_flow_key_from_mask(&mask, &facet->xout.wc.masks,
5067 &facet->flow, UINT32_MAX);
5069 ret = dpif_flow_put(subfacet->backer->dpif, flags, subfacet->key,
5070 subfacet->key_len, mask.data, mask.size,
5071 actions, actions_len, stats);
5074 subfacet_reset_dp_stats(subfacet, stats);
5078 COVERAGE_INC(subfacet_install_fail);
5080 subfacet->path = path;
5085 /* If 'subfacet' is installed in the datapath, uninstalls it. */
5087 subfacet_uninstall(struct subfacet *subfacet)
5089 if (subfacet->path != SF_NOT_INSTALLED) {
5090 struct rule_dpif *rule = subfacet->facet->rule;
5091 struct ofproto_dpif *ofproto = ofproto_dpif_cast(rule->up.ofproto);
5092 struct dpif_flow_stats stats;
5095 error = dpif_flow_del(ofproto->backer->dpif, subfacet->key,
5096 subfacet->key_len, &stats);
5097 subfacet_reset_dp_stats(subfacet, &stats);
5099 subfacet_update_stats(subfacet, &stats);
5101 subfacet->path = SF_NOT_INSTALLED;
5103 ovs_assert(subfacet->dp_packet_count == 0);
5104 ovs_assert(subfacet->dp_byte_count == 0);
5108 /* Resets 'subfacet''s datapath statistics counters. This should be called
5109 * when 'subfacet''s statistics are cleared in the datapath. If 'stats' is
5110 * non-null, it should contain the statistics returned by dpif when 'subfacet'
5111 * was reset in the datapath. 'stats' will be modified to include only
5112 * statistics new since 'subfacet' was last updated. */
5114 subfacet_reset_dp_stats(struct subfacet *subfacet,
5115 struct dpif_flow_stats *stats)
5118 && subfacet->dp_packet_count <= stats->n_packets
5119 && subfacet->dp_byte_count <= stats->n_bytes) {
5120 stats->n_packets -= subfacet->dp_packet_count;
5121 stats->n_bytes -= subfacet->dp_byte_count;
5124 subfacet->dp_packet_count = 0;
5125 subfacet->dp_byte_count = 0;
5128 /* Folds the statistics from 'stats' into the counters in 'subfacet'.
5130 * Because of the meaning of a subfacet's counters, it only makes sense to do
5131 * this if 'stats' are not tracked in the datapath, that is, if 'stats'
5132 * represents a packet that was sent by hand or if it represents statistics
5133 * that have been cleared out of the datapath. */
5135 subfacet_update_stats(struct subfacet *subfacet,
5136 const struct dpif_flow_stats *stats)
5138 if (stats->n_packets || stats->used > subfacet->used) {
5139 struct facet *facet = subfacet->facet;
5141 subfacet->used = MAX(subfacet->used, stats->used);
5142 facet->used = MAX(facet->used, stats->used);
5143 facet->packet_count += stats->n_packets;
5144 facet->byte_count += stats->n_bytes;
5145 facet->tcp_flags |= stats->tcp_flags;
5151 /* Lookup 'flow' in 'ofproto''s classifier. If 'wc' is non-null, sets
5152 * the fields that were relevant as part of the lookup. */
5153 static struct rule_dpif *
5154 rule_dpif_lookup(struct ofproto_dpif *ofproto, const struct flow *flow,
5155 struct flow_wildcards *wc)
5157 struct rule_dpif *rule;
5159 rule = rule_dpif_lookup_in_table(ofproto, flow, wc, 0);
5164 return rule_dpif_miss_rule(ofproto, flow);
5168 rule_dpif_lookup_in_table(struct ofproto_dpif *ofproto,
5169 const struct flow *flow, struct flow_wildcards *wc,
5172 struct cls_rule *cls_rule;
5173 struct classifier *cls;
5176 if (table_id >= N_TABLES) {
5181 memset(&wc->masks.dl_type, 0xff, sizeof wc->masks.dl_type);
5182 wc->masks.nw_frag |= FLOW_NW_FRAG_MASK;
5185 cls = &ofproto->up.tables[table_id].cls;
5186 frag = (flow->nw_frag & FLOW_NW_FRAG_ANY) != 0;
5187 if (frag && ofproto->up.frag_handling == OFPC_FRAG_NORMAL) {
5188 /* We must pretend that transport ports are unavailable. */
5189 struct flow ofpc_normal_flow = *flow;
5190 ofpc_normal_flow.tp_src = htons(0);
5191 ofpc_normal_flow.tp_dst = htons(0);
5192 cls_rule = classifier_lookup(cls, &ofpc_normal_flow, wc);
5193 } else if (frag && ofproto->up.frag_handling == OFPC_FRAG_DROP) {
5194 cls_rule = &ofproto->drop_frags_rule->up.cr;
5196 flow_wildcards_init_exact(wc);
5199 cls_rule = classifier_lookup(cls, flow, wc);
5201 return rule_dpif_cast(rule_from_cls_rule(cls_rule));
5205 rule_dpif_miss_rule(struct ofproto_dpif *ofproto, const struct flow *flow)
5207 struct ofport_dpif *port;
5209 port = get_ofp_port(ofproto, flow->in_port.ofp_port);
5211 VLOG_WARN_RL(&rl, "packet-in on unknown OpenFlow port %"PRIu16,
5212 flow->in_port.ofp_port);
5213 return ofproto->miss_rule;
5216 if (port->up.pp.config & OFPUTIL_PC_NO_PACKET_IN) {
5217 return ofproto->no_packet_in_rule;
5219 return ofproto->miss_rule;
5223 complete_operation(struct rule_dpif *rule)
5225 struct ofproto_dpif *ofproto = ofproto_dpif_cast(rule->up.ofproto);
5227 rule_invalidate(rule);
5229 struct dpif_completion *c = xmalloc(sizeof *c);
5230 c->op = rule->up.pending;
5231 list_push_back(&ofproto->completions, &c->list_node);
5233 ofoperation_complete(rule->up.pending, 0);
5237 static struct rule *
5240 struct rule_dpif *rule = xmalloc(sizeof *rule);
5245 rule_dealloc(struct rule *rule_)
5247 struct rule_dpif *rule = rule_dpif_cast(rule_);
5252 rule_construct(struct rule *rule_)
5254 struct rule_dpif *rule = rule_dpif_cast(rule_);
5255 struct ofproto_dpif *ofproto = ofproto_dpif_cast(rule->up.ofproto);
5256 struct rule_dpif *victim;
5259 rule->packet_count = 0;
5260 rule->byte_count = 0;
5262 victim = rule_dpif_cast(ofoperation_get_victim(rule->up.pending));
5263 if (victim && !list_is_empty(&victim->facets)) {
5264 struct facet *facet;
5266 rule->facets = victim->facets;
5267 list_moved(&rule->facets);
5268 LIST_FOR_EACH (facet, list_node, &rule->facets) {
5269 /* XXX: We're only clearing our local counters here. It's possible
5270 * that quite a few packets are unaccounted for in the datapath
5271 * statistics. These will be accounted to the new rule instead of
5272 * cleared as required. This could be fixed by clearing out the
5273 * datapath statistics for this facet, but currently it doesn't
5275 facet_reset_counters(facet);
5279 /* Must avoid list_moved() in this case. */
5280 list_init(&rule->facets);
5283 table_id = rule->up.table_id;
5285 rule->tag = victim->tag;
5286 } else if (table_id == 0) {
5291 miniflow_expand(&rule->up.cr.match.flow, &flow);
5292 rule->tag = rule_calculate_tag(&flow, &rule->up.cr.match.mask,
5293 ofproto->tables[table_id].basis);
5296 complete_operation(rule);
5301 rule_destruct(struct rule *rule_)
5303 struct rule_dpif *rule = rule_dpif_cast(rule_);
5304 struct facet *facet, *next_facet;
5306 LIST_FOR_EACH_SAFE (facet, next_facet, list_node, &rule->facets) {
5307 facet_revalidate(facet);
5310 complete_operation(rule);
5314 rule_get_stats(struct rule *rule_, uint64_t *packets, uint64_t *bytes)
5316 struct rule_dpif *rule = rule_dpif_cast(rule_);
5318 /* push_all_stats() can handle flow misses which, when using the learn
5319 * action, can cause rules to be added and deleted. This can corrupt our
5320 * caller's datastructures which assume that rule_get_stats() doesn't have
5321 * an impact on the flow table. To be safe, we disable miss handling. */
5322 push_all_stats__(false);
5324 /* Start from historical data for 'rule' itself that are no longer tracked
5325 * in facets. This counts, for example, facets that have expired. */
5326 *packets = rule->packet_count;
5327 *bytes = rule->byte_count;
5331 rule_dpif_execute(struct rule_dpif *rule, const struct flow *flow,
5332 struct ofpbuf *packet)
5334 struct ofproto_dpif *ofproto = ofproto_dpif_cast(rule->up.ofproto);
5335 struct dpif_flow_stats stats;
5336 struct xlate_out xout;
5337 struct xlate_in xin;
5339 dpif_flow_stats_extract(flow, packet, time_msec(), &stats);
5340 rule_credit_stats(rule, &stats);
5342 xlate_in_init(&xin, ofproto, flow, rule, stats.tcp_flags, packet);
5343 xin.resubmit_stats = &stats;
5344 xlate_actions(&xin, &xout);
5346 execute_odp_actions(ofproto, flow, xout.odp_actions.data,
5347 xout.odp_actions.size, packet);
5349 xlate_out_uninit(&xout);
5353 rule_execute(struct rule *rule, const struct flow *flow,
5354 struct ofpbuf *packet)
5356 rule_dpif_execute(rule_dpif_cast(rule), flow, packet);
5357 ofpbuf_delete(packet);
5362 rule_modify_actions(struct rule *rule_)
5364 struct rule_dpif *rule = rule_dpif_cast(rule_);
5366 complete_operation(rule);
5369 /* Sends 'packet' out 'ofport'.
5370 * May modify 'packet'.
5371 * Returns 0 if successful, otherwise a positive errno value. */
5373 send_packet(const struct ofport_dpif *ofport, struct ofpbuf *packet)
5375 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofport->up.ofproto);
5376 uint64_t odp_actions_stub[1024 / 8];
5377 struct ofpbuf key, odp_actions;
5378 struct dpif_flow_stats stats;
5379 struct odputil_keybuf keybuf;
5380 struct ofpact_output output;
5381 struct xlate_out xout;
5382 struct xlate_in xin;
5384 union flow_in_port in_port_;
5387 ofpbuf_use_stub(&odp_actions, odp_actions_stub, sizeof odp_actions_stub);
5388 ofpbuf_use_stack(&key, &keybuf, sizeof keybuf);
5390 /* Use OFPP_NONE as the in_port to avoid special packet processing. */
5391 in_port_.ofp_port = OFPP_NONE;
5392 flow_extract(packet, 0, 0, NULL, &in_port_, &flow);
5393 odp_flow_key_from_flow(&key, &flow, ofp_port_to_odp_port(ofproto,
5395 dpif_flow_stats_extract(&flow, packet, time_msec(), &stats);
5397 ofpact_init(&output.ofpact, OFPACT_OUTPUT, sizeof output);
5398 output.port = ofport->up.ofp_port;
5401 xlate_in_init(&xin, ofproto, &flow, NULL, 0, packet);
5402 xin.ofpacts_len = sizeof output;
5403 xin.ofpacts = &output.ofpact;
5404 xin.resubmit_stats = &stats;
5405 xlate_actions(&xin, &xout);
5407 error = dpif_execute(ofproto->backer->dpif,
5409 xout.odp_actions.data, xout.odp_actions.size,
5411 xlate_out_uninit(&xout);
5414 VLOG_WARN_RL(&rl, "%s: failed to send packet on port %s (%s)",
5415 ofproto->up.name, netdev_get_name(ofport->up.netdev),
5419 ofproto->stats.tx_packets++;
5420 ofproto->stats.tx_bytes += packet->size;
5424 /* Composes an ODP action for a "slow path" action for 'flow' within 'ofproto'.
5425 * The action will state 'slow' as the reason that the action is in the slow
5426 * path. (This is purely informational: it allows a human viewing "ovs-dpctl
5427 * dump-flows" output to see why a flow is in the slow path.)
5429 * The 'stub_size' bytes in 'stub' will be used to store the action.
5430 * 'stub_size' must be large enough for the action.
5432 * The action and its size will be stored in '*actionsp' and '*actions_lenp',
5435 compose_slow_path(const struct ofproto_dpif *ofproto, const struct flow *flow,
5436 enum slow_path_reason slow,
5437 uint64_t *stub, size_t stub_size,
5438 const struct nlattr **actionsp, size_t *actions_lenp)
5440 union user_action_cookie cookie;
5443 cookie.type = USER_ACTION_COOKIE_SLOW_PATH;
5444 cookie.slow_path.unused = 0;
5445 cookie.slow_path.reason = slow;
5447 ofpbuf_use_stack(&buf, stub, stub_size);
5448 if (slow & (SLOW_CFM | SLOW_BFD | SLOW_LACP | SLOW_STP)) {
5449 uint32_t pid = dpif_port_get_pid(ofproto->backer->dpif,
5451 odp_put_userspace_action(pid, &cookie, sizeof cookie.slow_path, &buf);
5453 put_userspace_action(ofproto, &buf, flow, &cookie,
5454 sizeof cookie.slow_path);
5456 *actionsp = buf.data;
5457 *actions_lenp = buf.size;
5461 put_userspace_action(const struct ofproto_dpif *ofproto,
5462 struct ofpbuf *odp_actions,
5463 const struct flow *flow,
5464 const union user_action_cookie *cookie,
5465 const size_t cookie_size)
5469 pid = dpif_port_get_pid(ofproto->backer->dpif,
5470 ofp_port_to_odp_port(ofproto,
5471 flow->in_port.ofp_port));
5473 return odp_put_userspace_action(pid, cookie, cookie_size, odp_actions);
5478 update_mirror_stats(struct ofproto_dpif *ofproto, mirror_mask_t mirrors,
5479 uint64_t packets, uint64_t bytes)
5485 for (; mirrors; mirrors = zero_rightmost_1bit(mirrors)) {
5488 m = ofproto->mirrors[mirror_mask_ffs(mirrors) - 1];
5491 /* In normal circumstances 'm' will not be NULL. However,
5492 * if mirrors are reconfigured, we can temporarily get out
5493 * of sync in facet_revalidate(). We could "correct" the
5494 * mirror list before reaching here, but doing that would
5495 * not properly account the traffic stats we've currently
5496 * accumulated for previous mirror configuration. */
5500 m->packet_count += packets;
5501 m->byte_count += bytes;
5506 calculate_flow_tag(struct ofproto_dpif *ofproto, const struct flow *flow,
5507 uint8_t table_id, struct rule_dpif *rule)
5509 if (table_id > 0 && table_id < N_TABLES) {
5510 struct table_dpif *table = &ofproto->tables[table_id];
5511 if (table->other_table) {
5512 return (rule && rule->tag
5514 : rule_calculate_tag(flow, &table->other_table->mask,
5522 /* Optimized flow revalidation.
5524 * It's a difficult problem, in general, to tell which facets need to have
5525 * their actions recalculated whenever the OpenFlow flow table changes. We
5526 * don't try to solve that general problem: for most kinds of OpenFlow flow
5527 * table changes, we recalculate the actions for every facet. This is
5528 * relatively expensive, but it's good enough if the OpenFlow flow table
5529 * doesn't change very often.
5531 * However, we can expect one particular kind of OpenFlow flow table change to
5532 * happen frequently: changes caused by MAC learning. To avoid wasting a lot
5533 * of CPU on revalidating every facet whenever MAC learning modifies the flow
5534 * table, we add a special case that applies to flow tables in which every rule
5535 * has the same form (that is, the same wildcards), except that the table is
5536 * also allowed to have a single "catch-all" flow that matches all packets. We
5537 * optimize this case by tagging all of the facets that resubmit into the table
5538 * and invalidating the same tag whenever a flow changes in that table. The
5539 * end result is that we revalidate just the facets that need it (and sometimes
5540 * a few more, but not all of the facets or even all of the facets that
5541 * resubmit to the table modified by MAC learning). */
5543 /* Calculates the tag to use for 'flow' and mask 'mask' when it is inserted
5544 * into an OpenFlow table with the given 'basis'. */
5546 rule_calculate_tag(const struct flow *flow, const struct minimask *mask,
5549 if (minimask_is_catchall(mask)) {
5552 uint32_t hash = flow_hash_in_minimask(flow, mask, secret);
5553 return tag_create_deterministic(hash);
5557 /* Following a change to OpenFlow table 'table_id' in 'ofproto', update the
5558 * taggability of that table.
5560 * This function must be called after *each* change to a flow table. If you
5561 * skip calling it on some changes then the pointer comparisons at the end can
5562 * be invalid if you get unlucky. For example, if a flow removal causes a
5563 * cls_table to be destroyed and then a flow insertion causes a cls_table with
5564 * different wildcards to be created with the same address, then this function
5565 * will incorrectly skip revalidation. */
5567 table_update_taggable(struct ofproto_dpif *ofproto, uint8_t table_id)
5569 struct table_dpif *table = &ofproto->tables[table_id];
5570 const struct oftable *oftable = &ofproto->up.tables[table_id];
5571 struct cls_table *catchall, *other;
5572 struct cls_table *t;
5574 catchall = other = NULL;
5576 switch (hmap_count(&oftable->cls.tables)) {
5578 /* We could tag this OpenFlow table but it would make the logic a
5579 * little harder and it's a corner case that doesn't seem worth it
5585 HMAP_FOR_EACH (t, hmap_node, &oftable->cls.tables) {
5586 if (cls_table_is_catchall(t)) {
5588 } else if (!other) {
5591 /* Indicate that we can't tag this by setting both tables to
5592 * NULL. (We know that 'catchall' is already NULL.) */
5599 /* Can't tag this table. */
5603 if (table->catchall_table != catchall || table->other_table != other) {
5604 table->catchall_table = catchall;
5605 table->other_table = other;
5606 ofproto->backer->need_revalidate = REV_FLOW_TABLE;
5610 /* Given 'rule' that has changed in some way (either it is a rule being
5611 * inserted, a rule being deleted, or a rule whose actions are being
5612 * modified), marks facets for revalidation to ensure that packets will be
5613 * forwarded correctly according to the new state of the flow table.
5615 * This function must be called after *each* change to a flow table. See
5616 * the comment on table_update_taggable() for more information. */
5618 rule_invalidate(const struct rule_dpif *rule)
5620 struct ofproto_dpif *ofproto = ofproto_dpif_cast(rule->up.ofproto);
5622 table_update_taggable(ofproto, rule->up.table_id);
5624 if (!ofproto->backer->need_revalidate) {
5625 struct table_dpif *table = &ofproto->tables[rule->up.table_id];
5627 if (table->other_table && rule->tag) {
5628 tag_set_add(&ofproto->backer->revalidate_set, rule->tag);
5630 ofproto->backer->need_revalidate = REV_FLOW_TABLE;
5636 set_frag_handling(struct ofproto *ofproto_,
5637 enum ofp_config_flags frag_handling)
5639 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
5640 if (frag_handling != OFPC_FRAG_REASM) {
5641 ofproto->backer->need_revalidate = REV_RECONFIGURE;
5649 packet_out(struct ofproto *ofproto_, struct ofpbuf *packet,
5650 const struct flow *flow,
5651 const struct ofpact *ofpacts, size_t ofpacts_len)
5653 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
5654 struct odputil_keybuf keybuf;
5655 struct dpif_flow_stats stats;
5656 struct xlate_out xout;
5657 struct xlate_in xin;
5661 ofpbuf_use_stack(&key, &keybuf, sizeof keybuf);
5662 odp_flow_key_from_flow(&key, flow,
5663 ofp_port_to_odp_port(ofproto,
5664 flow->in_port.ofp_port));
5666 dpif_flow_stats_extract(flow, packet, time_msec(), &stats);
5668 xlate_in_init(&xin, ofproto, flow, NULL, stats.tcp_flags, packet);
5669 xin.resubmit_stats = &stats;
5670 xin.ofpacts_len = ofpacts_len;
5671 xin.ofpacts = ofpacts;
5673 xlate_actions(&xin, &xout);
5674 dpif_execute(ofproto->backer->dpif, key.data, key.size,
5675 xout.odp_actions.data, xout.odp_actions.size, packet);
5676 xlate_out_uninit(&xout);
5684 set_netflow(struct ofproto *ofproto_,
5685 const struct netflow_options *netflow_options)
5687 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
5689 if (netflow_options) {
5690 if (!ofproto->netflow) {
5691 ofproto->netflow = netflow_create();
5692 ofproto->backer->need_revalidate = REV_RECONFIGURE;
5694 return netflow_set_options(ofproto->netflow, netflow_options);
5695 } else if (ofproto->netflow) {
5696 ofproto->backer->need_revalidate = REV_RECONFIGURE;
5697 netflow_destroy(ofproto->netflow);
5698 ofproto->netflow = NULL;
5705 get_netflow_ids(const struct ofproto *ofproto_,
5706 uint8_t *engine_type, uint8_t *engine_id)
5708 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofproto_);
5710 dpif_get_netflow_ids(ofproto->backer->dpif, engine_type, engine_id);
5714 send_active_timeout(struct ofproto_dpif *ofproto, struct facet *facet)
5716 if (!facet_is_controller_flow(facet) &&
5717 netflow_active_timeout_expired(ofproto->netflow, &facet->nf_flow)) {
5718 struct subfacet *subfacet;
5719 struct ofexpired expired;
5721 LIST_FOR_EACH (subfacet, list_node, &facet->subfacets) {
5722 if (subfacet->path == SF_FAST_PATH) {
5723 struct dpif_flow_stats stats;
5725 subfacet_install(subfacet, &facet->xout.odp_actions,
5727 subfacet_update_stats(subfacet, &stats);
5731 expired.flow = facet->flow;
5732 expired.packet_count = facet->packet_count;
5733 expired.byte_count = facet->byte_count;
5734 expired.used = facet->used;
5735 netflow_expire(ofproto->netflow, &facet->nf_flow, &expired);
5740 send_netflow_active_timeouts(struct ofproto_dpif *ofproto)
5742 struct cls_cursor cursor;
5743 struct facet *facet;
5745 cls_cursor_init(&cursor, &ofproto->facets, NULL);
5746 CLS_CURSOR_FOR_EACH (facet, cr, &cursor) {
5747 send_active_timeout(ofproto, facet);
5751 static struct ofproto_dpif *
5752 ofproto_dpif_lookup(const char *name)
5754 struct ofproto_dpif *ofproto;
5756 HMAP_FOR_EACH_WITH_HASH (ofproto, all_ofproto_dpifs_node,
5757 hash_string(name, 0), &all_ofproto_dpifs) {
5758 if (!strcmp(ofproto->up.name, name)) {
5766 ofproto_unixctl_fdb_flush(struct unixctl_conn *conn, int argc,
5767 const char *argv[], void *aux OVS_UNUSED)
5769 struct ofproto_dpif *ofproto;
5772 ofproto = ofproto_dpif_lookup(argv[1]);
5774 unixctl_command_reply_error(conn, "no such bridge");
5777 mac_learning_flush(ofproto->ml, &ofproto->backer->revalidate_set);
5779 HMAP_FOR_EACH (ofproto, all_ofproto_dpifs_node, &all_ofproto_dpifs) {
5780 mac_learning_flush(ofproto->ml, &ofproto->backer->revalidate_set);
5784 unixctl_command_reply(conn, "table successfully flushed");
5788 ofproto_unixctl_fdb_show(struct unixctl_conn *conn, int argc OVS_UNUSED,
5789 const char *argv[], void *aux OVS_UNUSED)
5791 struct ds ds = DS_EMPTY_INITIALIZER;
5792 const struct ofproto_dpif *ofproto;
5793 const struct mac_entry *e;
5795 ofproto = ofproto_dpif_lookup(argv[1]);
5797 unixctl_command_reply_error(conn, "no such bridge");
5801 ds_put_cstr(&ds, " port VLAN MAC Age\n");
5802 LIST_FOR_EACH (e, lru_node, &ofproto->ml->lrus) {
5803 struct ofbundle *bundle = e->port.p;
5804 char name[OFP_MAX_PORT_NAME_LEN];
5806 ofputil_port_to_string(ofbundle_get_a_port(bundle)->up.ofp_port,
5808 ds_put_format(&ds, "%5s %4d "ETH_ADDR_FMT" %3d\n",
5809 name, e->vlan, ETH_ADDR_ARGS(e->mac),
5810 mac_entry_age(ofproto->ml, e));
5812 unixctl_command_reply(conn, ds_cstr(&ds));
5817 struct xlate_out xout;
5818 struct xlate_in xin;
5824 trace_format_rule(struct ds *result, int level, const struct rule_dpif *rule)
5826 ds_put_char_multiple(result, '\t', level);
5828 ds_put_cstr(result, "No match\n");
5832 ds_put_format(result, "Rule: table=%"PRIu8" cookie=%#"PRIx64" ",
5833 rule ? rule->up.table_id : 0, ntohll(rule->up.flow_cookie));
5834 cls_rule_format(&rule->up.cr, result);
5835 ds_put_char(result, '\n');
5837 ds_put_char_multiple(result, '\t', level);
5838 ds_put_cstr(result, "OpenFlow ");
5839 ofpacts_format(rule->up.ofpacts, rule->up.ofpacts_len, result);
5840 ds_put_char(result, '\n');
5844 trace_format_flow(struct ds *result, int level, const char *title,
5845 struct trace_ctx *trace)
5847 ds_put_char_multiple(result, '\t', level);
5848 ds_put_format(result, "%s: ", title);
5849 if (flow_equal(&trace->xin.flow, &trace->flow)) {
5850 ds_put_cstr(result, "unchanged");
5852 flow_format(result, &trace->xin.flow);
5853 trace->flow = trace->xin.flow;
5855 ds_put_char(result, '\n');
5859 trace_format_regs(struct ds *result, int level, const char *title,
5860 struct trace_ctx *trace)
5864 ds_put_char_multiple(result, '\t', level);
5865 ds_put_format(result, "%s:", title);
5866 for (i = 0; i < FLOW_N_REGS; i++) {
5867 ds_put_format(result, " reg%zu=0x%"PRIx32, i, trace->flow.regs[i]);
5869 ds_put_char(result, '\n');
5873 trace_format_odp(struct ds *result, int level, const char *title,
5874 struct trace_ctx *trace)
5876 struct ofpbuf *odp_actions = &trace->xout.odp_actions;
5878 ds_put_char_multiple(result, '\t', level);
5879 ds_put_format(result, "%s: ", title);
5880 format_odp_actions(result, odp_actions->data, odp_actions->size);
5881 ds_put_char(result, '\n');
5885 trace_resubmit(struct xlate_in *xin, struct rule_dpif *rule, int recurse)
5887 struct trace_ctx *trace = CONTAINER_OF(xin, struct trace_ctx, xin);
5888 struct ds *result = trace->result;
5890 ds_put_char(result, '\n');
5891 trace_format_flow(result, recurse + 1, "Resubmitted flow", trace);
5892 trace_format_regs(result, recurse + 1, "Resubmitted regs", trace);
5893 trace_format_odp(result, recurse + 1, "Resubmitted odp", trace);
5894 trace_format_rule(result, recurse + 1, rule);
5898 trace_report(struct xlate_in *xin, const char *s, int recurse)
5900 struct trace_ctx *trace = CONTAINER_OF(xin, struct trace_ctx, xin);
5901 struct ds *result = trace->result;
5903 ds_put_char_multiple(result, '\t', recurse);
5904 ds_put_cstr(result, s);
5905 ds_put_char(result, '\n');
5909 ofproto_unixctl_trace(struct unixctl_conn *conn, int argc, const char *argv[],
5910 void *aux OVS_UNUSED)
5912 const struct dpif_backer *backer;
5913 struct ofproto_dpif *ofproto;
5914 struct ofpbuf odp_key;
5915 struct ofpbuf *packet;
5923 ofpbuf_init(&odp_key, 0);
5925 /* Handle "-generate" or a hex string as the last argument. */
5926 if (!strcmp(argv[argc - 1], "-generate")) {
5927 packet = ofpbuf_new(0);
5930 const char *error = eth_from_hex(argv[argc - 1], &packet);
5933 } else if (argc == 4) {
5934 /* The 3-argument form must end in "-generate' or a hex string. */
5935 unixctl_command_reply_error(conn, error);
5940 /* Parse the flow and determine whether a datapath or
5941 * bridge is specified. If function odp_flow_key_from_string()
5942 * returns 0, the flow is a odp_flow. If function
5943 * parse_ofp_exact_flow() returns 0, the flow is a br_flow. */
5944 if (!odp_flow_from_string(argv[argc - 1], NULL, &odp_key, NULL)) {
5945 /* If the odp_flow is the second argument,
5946 * the datapath name is the first argument. */
5948 const char *dp_type;
5949 if (!strncmp(argv[1], "ovs-", 4)) {
5950 dp_type = argv[1] + 4;
5954 backer = shash_find_data(&all_dpif_backers, dp_type);
5956 unixctl_command_reply_error(conn, "Cannot find datapath "
5961 /* No datapath name specified, so there should be only one
5963 struct shash_node *node;
5964 if (shash_count(&all_dpif_backers) != 1) {
5965 unixctl_command_reply_error(conn, "Must specify datapath "
5966 "name, there is more than one type of datapath");
5969 node = shash_first(&all_dpif_backers);
5970 backer = node->data;
5973 /* Extract the ofproto_dpif object from the ofproto_receive()
5975 if (ofproto_receive(backer, NULL, odp_key.data,
5976 odp_key.size, &flow, NULL, &ofproto, NULL)) {
5977 unixctl_command_reply_error(conn, "Invalid datapath flow");
5980 ds_put_format(&result, "Bridge: %s\n", ofproto->up.name);
5981 } else if (!parse_ofp_exact_flow(&flow, argv[argc - 1])) {
5983 unixctl_command_reply_error(conn, "Must specify bridge name");
5987 ofproto = ofproto_dpif_lookup(argv[1]);
5989 unixctl_command_reply_error(conn, "Unknown bridge name");
5993 unixctl_command_reply_error(conn, "Bad flow syntax");
5997 /* Generate a packet, if requested. */
5999 if (!packet->size) {
6000 flow_compose(packet, &flow);
6002 union flow_in_port in_port_;
6004 in_port_ = flow.in_port;
6005 ds_put_cstr(&result, "Packet: ");
6006 s = ofp_packet_to_string(packet->data, packet->size);
6007 ds_put_cstr(&result, s);
6010 /* Use the metadata from the flow and the packet argument
6011 * to reconstruct the flow. */
6012 flow_extract(packet, flow.skb_priority, flow.skb_mark, NULL,
6017 ofproto_trace(ofproto, &flow, packet, &result);
6018 unixctl_command_reply(conn, ds_cstr(&result));
6021 ds_destroy(&result);
6022 ofpbuf_delete(packet);
6023 ofpbuf_uninit(&odp_key);
6027 ofproto_trace(struct ofproto_dpif *ofproto, const struct flow *flow,
6028 const struct ofpbuf *packet, struct ds *ds)
6030 struct rule_dpif *rule;
6032 ds_put_cstr(ds, "Flow: ");
6033 flow_format(ds, flow);
6034 ds_put_char(ds, '\n');
6036 rule = rule_dpif_lookup(ofproto, flow, NULL);
6038 trace_format_rule(ds, 0, rule);
6039 if (rule == ofproto->miss_rule) {
6040 ds_put_cstr(ds, "\nNo match, flow generates \"packet in\"s.\n");
6041 } else if (rule == ofproto->no_packet_in_rule) {
6042 ds_put_cstr(ds, "\nNo match, packets dropped because "
6043 "OFPPC_NO_PACKET_IN is set on in_port.\n");
6044 } else if (rule == ofproto->drop_frags_rule) {
6045 ds_put_cstr(ds, "\nPackets dropped because they are IP fragments "
6046 "and the fragment handling mode is \"drop\".\n");
6050 uint64_t odp_actions_stub[1024 / 8];
6051 struct ofpbuf odp_actions;
6052 struct trace_ctx trace;
6056 tcp_flags = packet ? packet_get_tcp_flags(packet, flow) : 0;
6059 ofpbuf_use_stub(&odp_actions,
6060 odp_actions_stub, sizeof odp_actions_stub);
6061 xlate_in_init(&trace.xin, ofproto, flow, rule, tcp_flags, packet);
6062 trace.xin.resubmit_hook = trace_resubmit;
6063 trace.xin.report_hook = trace_report;
6065 xlate_actions(&trace.xin, &trace.xout);
6067 ds_put_char(ds, '\n');
6068 trace_format_flow(ds, 0, "Final flow", &trace);
6070 match_init(&match, flow, &trace.xout.wc);
6071 ds_put_cstr(ds, "Relevant fields: ");
6072 match_format(&match, ds, OFP_DEFAULT_PRIORITY);
6073 ds_put_char(ds, '\n');
6075 ds_put_cstr(ds, "Datapath actions: ");
6076 format_odp_actions(ds, trace.xout.odp_actions.data,
6077 trace.xout.odp_actions.size);
6079 if (trace.xout.slow) {
6080 ds_put_cstr(ds, "\nThis flow is handled by the userspace "
6081 "slow path because it:");
6082 switch (trace.xout.slow) {
6084 ds_put_cstr(ds, "\n\t- Consists of CFM packets.");
6087 ds_put_cstr(ds, "\n\t- Consists of LACP packets.");
6090 ds_put_cstr(ds, "\n\t- Consists of STP packets.");
6093 ds_put_cstr(ds, "\n\t- Consists of BFD packets.");
6095 case SLOW_CONTROLLER:
6096 ds_put_cstr(ds, "\n\t- Sends \"packet-in\" messages "
6097 "to the OpenFlow controller.");
6104 xlate_out_uninit(&trace.xout);
6109 ofproto_dpif_clog(struct unixctl_conn *conn OVS_UNUSED, int argc OVS_UNUSED,
6110 const char *argv[] OVS_UNUSED, void *aux OVS_UNUSED)
6113 unixctl_command_reply(conn, NULL);
6117 ofproto_dpif_unclog(struct unixctl_conn *conn OVS_UNUSED, int argc OVS_UNUSED,
6118 const char *argv[] OVS_UNUSED, void *aux OVS_UNUSED)
6121 unixctl_command_reply(conn, NULL);
6124 /* Runs a self-check of flow translations in 'ofproto'. Appends a message to
6125 * 'reply' describing the results. */
6127 ofproto_dpif_self_check__(struct ofproto_dpif *ofproto, struct ds *reply)
6129 struct cls_cursor cursor;
6130 struct facet *facet;
6134 cls_cursor_init(&cursor, &ofproto->facets, NULL);
6135 CLS_CURSOR_FOR_EACH (facet, cr, &cursor) {
6136 if (!facet_check_consistency(facet)) {
6141 ofproto->backer->need_revalidate = REV_INCONSISTENCY;
6145 ds_put_format(reply, "%s: self-check failed (%d errors)\n",
6146 ofproto->up.name, errors);
6148 ds_put_format(reply, "%s: self-check passed\n", ofproto->up.name);
6153 ofproto_dpif_self_check(struct unixctl_conn *conn,
6154 int argc, const char *argv[], void *aux OVS_UNUSED)
6156 struct ds reply = DS_EMPTY_INITIALIZER;
6157 struct ofproto_dpif *ofproto;
6160 ofproto = ofproto_dpif_lookup(argv[1]);
6162 unixctl_command_reply_error(conn, "Unknown ofproto (use "
6163 "ofproto/list for help)");
6166 ofproto_dpif_self_check__(ofproto, &reply);
6168 HMAP_FOR_EACH (ofproto, all_ofproto_dpifs_node, &all_ofproto_dpifs) {
6169 ofproto_dpif_self_check__(ofproto, &reply);
6173 unixctl_command_reply(conn, ds_cstr(&reply));
6177 /* Store the current ofprotos in 'ofproto_shash'. Returns a sorted list
6178 * of the 'ofproto_shash' nodes. It is the responsibility of the caller
6179 * to destroy 'ofproto_shash' and free the returned value. */
6180 static const struct shash_node **
6181 get_ofprotos(struct shash *ofproto_shash)
6183 const struct ofproto_dpif *ofproto;
6185 HMAP_FOR_EACH (ofproto, all_ofproto_dpifs_node, &all_ofproto_dpifs) {
6186 char *name = xasprintf("%s@%s", ofproto->up.type, ofproto->up.name);
6187 shash_add_nocopy(ofproto_shash, name, ofproto);
6190 return shash_sort(ofproto_shash);
6194 ofproto_unixctl_dpif_dump_dps(struct unixctl_conn *conn, int argc OVS_UNUSED,
6195 const char *argv[] OVS_UNUSED,
6196 void *aux OVS_UNUSED)
6198 struct ds ds = DS_EMPTY_INITIALIZER;
6199 struct shash ofproto_shash;
6200 const struct shash_node **sorted_ofprotos;
6203 shash_init(&ofproto_shash);
6204 sorted_ofprotos = get_ofprotos(&ofproto_shash);
6205 for (i = 0; i < shash_count(&ofproto_shash); i++) {
6206 const struct shash_node *node = sorted_ofprotos[i];
6207 ds_put_format(&ds, "%s\n", node->name);
6210 shash_destroy(&ofproto_shash);
6211 free(sorted_ofprotos);
6213 unixctl_command_reply(conn, ds_cstr(&ds));
6218 show_dp_rates(struct ds *ds, const char *heading,
6219 const struct avg_subfacet_rates *rates)
6221 ds_put_format(ds, "%s add rate: %5.3f/min, del rate: %5.3f/min\n",
6222 heading, rates->add_rate, rates->del_rate);
6226 dpif_show_backer(const struct dpif_backer *backer, struct ds *ds)
6228 const struct shash_node **ofprotos;
6229 struct ofproto_dpif *ofproto;
6230 struct shash ofproto_shash;
6231 uint64_t n_hit, n_missed;
6232 long long int minutes;
6235 n_hit = n_missed = 0;
6236 HMAP_FOR_EACH (ofproto, all_ofproto_dpifs_node, &all_ofproto_dpifs) {
6237 if (ofproto->backer == backer) {
6238 n_missed += ofproto->n_missed;
6239 n_hit += ofproto->n_hit;
6243 ds_put_format(ds, "%s: hit:%"PRIu64" missed:%"PRIu64"\n",
6244 dpif_name(backer->dpif), n_hit, n_missed);
6245 ds_put_format(ds, "\tflows: cur: %zu, avg: %u, max: %u,"
6246 " life span: %lldms\n", hmap_count(&backer->subfacets),
6247 backer->avg_n_subfacet, backer->max_n_subfacet,
6248 backer->avg_subfacet_life);
6250 minutes = (time_msec() - backer->created) / (1000 * 60);
6251 if (minutes >= 60) {
6252 show_dp_rates(ds, "\thourly avg:", &backer->hourly);
6254 if (minutes >= 60 * 24) {
6255 show_dp_rates(ds, "\tdaily avg:", &backer->daily);
6257 show_dp_rates(ds, "\toverall avg:", &backer->lifetime);
6259 shash_init(&ofproto_shash);
6260 ofprotos = get_ofprotos(&ofproto_shash);
6261 for (i = 0; i < shash_count(&ofproto_shash); i++) {
6262 struct ofproto_dpif *ofproto = ofprotos[i]->data;
6263 const struct shash_node **ports;
6266 if (ofproto->backer != backer) {
6270 ds_put_format(ds, "\t%s: hit:%"PRIu64" missed:%"PRIu64"\n",
6271 ofproto->up.name, ofproto->n_hit, ofproto->n_missed);
6273 ports = shash_sort(&ofproto->up.port_by_name);
6274 for (j = 0; j < shash_count(&ofproto->up.port_by_name); j++) {
6275 const struct shash_node *node = ports[j];
6276 struct ofport *ofport = node->data;
6278 odp_port_t odp_port;
6280 ds_put_format(ds, "\t\t%s %u/", netdev_get_name(ofport->netdev),
6283 odp_port = ofp_port_to_odp_port(ofproto, ofport->ofp_port);
6284 if (odp_port != ODPP_NONE) {
6285 ds_put_format(ds, "%"PRIu32":", odp_port);
6287 ds_put_cstr(ds, "none:");
6290 ds_put_format(ds, " (%s", netdev_get_type(ofport->netdev));
6293 if (!netdev_get_config(ofport->netdev, &config)) {
6294 const struct smap_node **nodes;
6297 nodes = smap_sort(&config);
6298 for (i = 0; i < smap_count(&config); i++) {
6299 const struct smap_node *node = nodes[i];
6300 ds_put_format(ds, "%c %s=%s", i ? ',' : ':',
6301 node->key, node->value);
6305 smap_destroy(&config);
6307 ds_put_char(ds, ')');
6308 ds_put_char(ds, '\n');
6312 shash_destroy(&ofproto_shash);
6317 ofproto_unixctl_dpif_show(struct unixctl_conn *conn, int argc OVS_UNUSED,
6318 const char *argv[] OVS_UNUSED, void *aux OVS_UNUSED)
6320 struct ds ds = DS_EMPTY_INITIALIZER;
6321 const struct shash_node **backers;
6324 backers = shash_sort(&all_dpif_backers);
6325 for (i = 0; i < shash_count(&all_dpif_backers); i++) {
6326 dpif_show_backer(backers[i]->data, &ds);
6330 unixctl_command_reply(conn, ds_cstr(&ds));
6334 /* Dump the megaflow (facet) cache. This is useful to check the
6335 * correctness of flow wildcarding, since the same mechanism is used for
6336 * both xlate caching and kernel wildcarding.
6338 * It's important to note that in the output the flow description uses
6339 * OpenFlow (OFP) ports, but the actions use datapath (ODP) ports.
6341 * This command is only needed for advanced debugging, so it's not
6342 * documented in the man page. */
6344 ofproto_unixctl_dpif_dump_megaflows(struct unixctl_conn *conn,
6345 int argc OVS_UNUSED, const char *argv[],
6346 void *aux OVS_UNUSED)
6348 struct ds ds = DS_EMPTY_INITIALIZER;
6349 const struct ofproto_dpif *ofproto;
6350 long long int now = time_msec();
6351 struct cls_cursor cursor;
6352 struct facet *facet;
6354 ofproto = ofproto_dpif_lookup(argv[1]);
6356 unixctl_command_reply_error(conn, "no such bridge");
6360 cls_cursor_init(&cursor, &ofproto->facets, NULL);
6361 CLS_CURSOR_FOR_EACH (facet, cr, &cursor) {
6362 cls_rule_format(&facet->cr, &ds);
6363 ds_put_cstr(&ds, ", ");
6364 ds_put_format(&ds, "n_subfacets:%zu, ", list_size(&facet->subfacets));
6365 ds_put_format(&ds, "used:%.3fs, ", (now - facet->used) / 1000.0);
6366 ds_put_cstr(&ds, "Datapath actions: ");
6367 if (facet->xout.slow) {
6368 uint64_t slow_path_stub[128 / 8];
6369 const struct nlattr *actions;
6372 compose_slow_path(ofproto, &facet->flow, facet->xout.slow,
6373 slow_path_stub, sizeof slow_path_stub,
6374 &actions, &actions_len);
6375 format_odp_actions(&ds, actions, actions_len);
6377 format_odp_actions(&ds, facet->xout.odp_actions.data,
6378 facet->xout.odp_actions.size);
6380 ds_put_cstr(&ds, "\n");
6383 ds_chomp(&ds, '\n');
6384 unixctl_command_reply(conn, ds_cstr(&ds));
6389 ofproto_unixctl_dpif_dump_flows(struct unixctl_conn *conn,
6390 int argc OVS_UNUSED, const char *argv[],
6391 void *aux OVS_UNUSED)
6393 struct ds ds = DS_EMPTY_INITIALIZER;
6394 const struct ofproto_dpif *ofproto;
6395 struct subfacet *subfacet;
6397 ofproto = ofproto_dpif_lookup(argv[1]);
6399 unixctl_command_reply_error(conn, "no such bridge");
6403 update_stats(ofproto->backer);
6405 HMAP_FOR_EACH (subfacet, hmap_node, &ofproto->backer->subfacets) {
6406 struct facet *facet = subfacet->facet;
6408 if (ofproto_dpif_cast(facet->rule->up.ofproto) != ofproto) {
6412 odp_flow_key_format(subfacet->key, subfacet->key_len, &ds);
6414 ds_put_format(&ds, ", packets:%"PRIu64", bytes:%"PRIu64", used:",
6415 subfacet->dp_packet_count, subfacet->dp_byte_count);
6416 if (subfacet->used) {
6417 ds_put_format(&ds, "%.3fs",
6418 (time_msec() - subfacet->used) / 1000.0);
6420 ds_put_format(&ds, "never");
6422 if (subfacet->facet->tcp_flags) {
6423 ds_put_cstr(&ds, ", flags:");
6424 packet_format_tcp_flags(&ds, subfacet->facet->tcp_flags);
6427 ds_put_cstr(&ds, ", actions:");
6428 if (facet->xout.slow) {
6429 uint64_t slow_path_stub[128 / 8];
6430 const struct nlattr *actions;
6433 compose_slow_path(ofproto, &facet->flow, facet->xout.slow,
6434 slow_path_stub, sizeof slow_path_stub,
6435 &actions, &actions_len);
6436 format_odp_actions(&ds, actions, actions_len);
6438 format_odp_actions(&ds, facet->xout.odp_actions.data,
6439 facet->xout.odp_actions.size);
6441 ds_put_char(&ds, '\n');
6444 unixctl_command_reply(conn, ds_cstr(&ds));
6449 ofproto_unixctl_dpif_del_flows(struct unixctl_conn *conn,
6450 int argc OVS_UNUSED, const char *argv[],
6451 void *aux OVS_UNUSED)
6453 struct ds ds = DS_EMPTY_INITIALIZER;
6454 struct ofproto_dpif *ofproto;
6456 ofproto = ofproto_dpif_lookup(argv[1]);
6458 unixctl_command_reply_error(conn, "no such bridge");
6462 flush(&ofproto->up);
6464 unixctl_command_reply(conn, ds_cstr(&ds));
6469 ofproto_dpif_unixctl_init(void)
6471 static bool registered;
6477 unixctl_command_register(
6479 "[dp_name]|bridge odp_flow|br_flow [-generate|packet]",
6480 1, 3, ofproto_unixctl_trace, NULL);
6481 unixctl_command_register("fdb/flush", "[bridge]", 0, 1,
6482 ofproto_unixctl_fdb_flush, NULL);
6483 unixctl_command_register("fdb/show", "bridge", 1, 1,
6484 ofproto_unixctl_fdb_show, NULL);
6485 unixctl_command_register("ofproto/clog", "", 0, 0,
6486 ofproto_dpif_clog, NULL);
6487 unixctl_command_register("ofproto/unclog", "", 0, 0,
6488 ofproto_dpif_unclog, NULL);
6489 unixctl_command_register("ofproto/self-check", "[bridge]", 0, 1,
6490 ofproto_dpif_self_check, NULL);
6491 unixctl_command_register("dpif/dump-dps", "", 0, 0,
6492 ofproto_unixctl_dpif_dump_dps, NULL);
6493 unixctl_command_register("dpif/show", "", 0, 0, ofproto_unixctl_dpif_show,
6495 unixctl_command_register("dpif/dump-flows", "bridge", 1, 1,
6496 ofproto_unixctl_dpif_dump_flows, NULL);
6497 unixctl_command_register("dpif/del-flows", "bridge", 1, 1,
6498 ofproto_unixctl_dpif_del_flows, NULL);
6499 unixctl_command_register("dpif/dump-megaflows", "bridge", 1, 1,
6500 ofproto_unixctl_dpif_dump_megaflows, NULL);
6503 /* Linux VLAN device support (e.g. "eth0.10" for VLAN 10.)
6505 * This is deprecated. It is only for compatibility with broken device drivers
6506 * in old versions of Linux that do not properly support VLANs when VLAN
6507 * devices are not used. When broken device drivers are no longer in
6508 * widespread use, we will delete these interfaces. */
6511 set_realdev(struct ofport *ofport_, ofp_port_t realdev_ofp_port, int vid)
6513 struct ofproto_dpif *ofproto = ofproto_dpif_cast(ofport_->ofproto);
6514 struct ofport_dpif *ofport = ofport_dpif_cast(ofport_);
6516 if (realdev_ofp_port == ofport->realdev_ofp_port
6517 && vid == ofport->vlandev_vid) {
6521 ofproto->backer->need_revalidate = REV_RECONFIGURE;
6523 if (ofport->realdev_ofp_port) {
6526 if (realdev_ofp_port && ofport->bundle) {
6527 /* vlandevs are enslaved to their realdevs, so they are not allowed to
6528 * themselves be part of a bundle. */
6529 bundle_set(ofport->up.ofproto, ofport->bundle, NULL);
6532 ofport->realdev_ofp_port = realdev_ofp_port;
6533 ofport->vlandev_vid = vid;
6535 if (realdev_ofp_port) {
6536 vsp_add(ofport, realdev_ofp_port, vid);
6543 hash_realdev_vid(ofp_port_t realdev_ofp_port, int vid)
6545 return hash_2words(ofp_to_u16(realdev_ofp_port), vid);
6548 /* Returns the OFP port number of the Linux VLAN device that corresponds to
6549 * 'vlan_tci' on the network device with port number 'realdev_ofp_port' in
6550 * 'struct ofport_dpif'. For example, given 'realdev_ofp_port' of eth0 and
6551 * 'vlan_tci' 9, it would return the port number of eth0.9.
6553 * Unless VLAN splinters are enabled for port 'realdev_ofp_port', this
6554 * function just returns its 'realdev_ofp_port' argument. */
6556 vsp_realdev_to_vlandev(const struct ofproto_dpif *ofproto,
6557 ofp_port_t realdev_ofp_port, ovs_be16 vlan_tci)
6559 if (!hmap_is_empty(&ofproto->realdev_vid_map)) {
6560 int vid = vlan_tci_to_vid(vlan_tci);
6561 const struct vlan_splinter *vsp;
6563 HMAP_FOR_EACH_WITH_HASH (vsp, realdev_vid_node,
6564 hash_realdev_vid(realdev_ofp_port, vid),
6565 &ofproto->realdev_vid_map) {
6566 if (vsp->realdev_ofp_port == realdev_ofp_port
6567 && vsp->vid == vid) {
6568 return vsp->vlandev_ofp_port;
6572 return realdev_ofp_port;
6575 static struct vlan_splinter *
6576 vlandev_find(const struct ofproto_dpif *ofproto, ofp_port_t vlandev_ofp_port)
6578 struct vlan_splinter *vsp;
6580 HMAP_FOR_EACH_WITH_HASH (vsp, vlandev_node,
6581 hash_ofp_port(vlandev_ofp_port),
6582 &ofproto->vlandev_map) {
6583 if (vsp->vlandev_ofp_port == vlandev_ofp_port) {
6591 /* Returns the OpenFlow port number of the "real" device underlying the Linux
6592 * VLAN device with OpenFlow port number 'vlandev_ofp_port' and stores the
6593 * VLAN VID of the Linux VLAN device in '*vid'. For example, given
6594 * 'vlandev_ofp_port' of eth0.9, it would return the OpenFlow port number of
6595 * eth0 and store 9 in '*vid'.
6597 * Returns 0 and does not modify '*vid' if 'vlandev_ofp_port' is not a Linux
6598 * VLAN device. Unless VLAN splinters are enabled, this is what this function
6601 vsp_vlandev_to_realdev(const struct ofproto_dpif *ofproto,
6602 ofp_port_t vlandev_ofp_port, int *vid)
6604 if (!hmap_is_empty(&ofproto->vlandev_map)) {
6605 const struct vlan_splinter *vsp;
6607 vsp = vlandev_find(ofproto, vlandev_ofp_port);
6612 return vsp->realdev_ofp_port;
6618 /* Given 'flow', a flow representing a packet received on 'ofproto', checks
6619 * whether 'flow->in_port' represents a Linux VLAN device. If so, changes
6620 * 'flow->in_port' to the "real" device backing the VLAN device, sets
6621 * 'flow->vlan_tci' to the VLAN VID, and returns true. Otherwise (which is
6622 * always the case unless VLAN splinters are enabled), returns false without
6623 * making any changes. */
6625 vsp_adjust_flow(const struct ofproto_dpif *ofproto, struct flow *flow)
6630 realdev = vsp_vlandev_to_realdev(ofproto, flow->in_port.ofp_port, &vid);
6635 /* Cause the flow to be processed as if it came in on the real device with
6636 * the VLAN device's VLAN ID. */
6637 flow->in_port.ofp_port = realdev;
6638 flow->vlan_tci = htons((vid & VLAN_VID_MASK) | VLAN_CFI);
6643 vsp_remove(struct ofport_dpif *port)
6645 struct ofproto_dpif *ofproto = ofproto_dpif_cast(port->up.ofproto);
6646 struct vlan_splinter *vsp;
6648 vsp = vlandev_find(ofproto, port->up.ofp_port);
6650 hmap_remove(&ofproto->vlandev_map, &vsp->vlandev_node);
6651 hmap_remove(&ofproto->realdev_vid_map, &vsp->realdev_vid_node);
6654 port->realdev_ofp_port = 0;
6656 VLOG_ERR("missing vlan device record");
6661 vsp_add(struct ofport_dpif *port, ofp_port_t realdev_ofp_port, int vid)
6663 struct ofproto_dpif *ofproto = ofproto_dpif_cast(port->up.ofproto);
6665 if (!vsp_vlandev_to_realdev(ofproto, port->up.ofp_port, NULL)
6666 && (vsp_realdev_to_vlandev(ofproto, realdev_ofp_port, htons(vid))
6667 == realdev_ofp_port)) {
6668 struct vlan_splinter *vsp;
6670 vsp = xmalloc(sizeof *vsp);
6671 hmap_insert(&ofproto->vlandev_map, &vsp->vlandev_node,
6672 hash_ofp_port(port->up.ofp_port));
6673 hmap_insert(&ofproto->realdev_vid_map, &vsp->realdev_vid_node,
6674 hash_realdev_vid(realdev_ofp_port, vid));
6675 vsp->realdev_ofp_port = realdev_ofp_port;
6676 vsp->vlandev_ofp_port = port->up.ofp_port;
6679 port->realdev_ofp_port = realdev_ofp_port;
6681 VLOG_ERR("duplicate vlan device record");
6686 ofp_port_to_odp_port(const struct ofproto_dpif *ofproto, ofp_port_t ofp_port)
6688 const struct ofport_dpif *ofport = get_ofp_port(ofproto, ofp_port);
6689 return ofport ? ofport->odp_port : ODPP_NONE;
6692 static struct ofport_dpif *
6693 odp_port_to_ofport(const struct dpif_backer *backer, odp_port_t odp_port)
6695 struct ofport_dpif *port;
6697 HMAP_FOR_EACH_IN_BUCKET (port, odp_port_node, hash_odp_port(odp_port),
6698 &backer->odp_to_ofport_map) {
6699 if (port->odp_port == odp_port) {
6708 odp_port_to_ofp_port(const struct ofproto_dpif *ofproto, odp_port_t odp_port)
6710 struct ofport_dpif *port;
6712 port = odp_port_to_ofport(ofproto->backer, odp_port);
6713 if (port && &ofproto->up == port->up.ofproto) {
6714 return port->up.ofp_port;
6720 /* Compute exponentially weighted moving average, adding 'new' as the newest,
6721 * most heavily weighted element. 'base' designates the rate of decay: after
6722 * 'base' further updates, 'new''s weight in the EWMA decays to about 1/e
6725 exp_mavg(double *avg, int base, double new)
6727 *avg = (*avg * (base - 1) + new) / base;
6731 update_moving_averages(struct dpif_backer *backer)
6733 const int min_ms = 60 * 1000; /* milliseconds in one minute. */
6734 long long int minutes = (time_msec() - backer->created) / min_ms;
6737 backer->lifetime.add_rate = (double) backer->total_subfacet_add_count
6739 backer->lifetime.del_rate = (double) backer->total_subfacet_del_count
6742 backer->lifetime.add_rate = 0.0;
6743 backer->lifetime.del_rate = 0.0;
6746 /* Update hourly averages on the minute boundaries. */
6747 if (time_msec() - backer->last_minute >= min_ms) {
6748 exp_mavg(&backer->hourly.add_rate, 60, backer->subfacet_add_count);
6749 exp_mavg(&backer->hourly.del_rate, 60, backer->subfacet_del_count);
6751 /* Update daily averages on the hour boundaries. */
6752 if ((backer->last_minute - backer->created) / min_ms % 60 == 59) {
6753 exp_mavg(&backer->daily.add_rate, 24, backer->hourly.add_rate);
6754 exp_mavg(&backer->daily.del_rate, 24, backer->hourly.del_rate);
6757 backer->total_subfacet_add_count += backer->subfacet_add_count;
6758 backer->total_subfacet_del_count += backer->subfacet_del_count;
6759 backer->subfacet_add_count = 0;
6760 backer->subfacet_del_count = 0;
6761 backer->last_minute += min_ms;
6765 const struct ofproto_class ofproto_dpif_class = {
6800 port_is_lacp_current,
6801 NULL, /* rule_choose_table */
6808 rule_modify_actions,
6822 get_stp_port_status,
6829 is_mirror_output_bundle,
6830 forward_bpdu_changed,
6831 set_mac_table_config,