]> git.proxmox.com Git - mirror_ovs.git/blob - lib/dpif.h
ovs-vswitchd: Better document that ovs-vswitchd manages its own datapaths.
[mirror_ovs.git] / lib / dpif.h
1 /*
2 * Copyright (c) 2008, 2009, 2010, 2011, 2012, 2013, 2014 Nicira, Inc.
3 *
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:
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
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.
15 */
16
17 /*
18 * dpif, the DataPath InterFace.
19 *
20 * In Open vSwitch terminology, a "datapath" is a flow-based software switch.
21 * A datapath has no intelligence of its own. Rather, it relies entirely on
22 * its client to set up flows. The datapath layer is core to the Open vSwitch
23 * software switch: one could say, without much exaggeration, that everything
24 * in ovs-vswitchd above dpif exists only to make the correct decisions
25 * interacting with dpif.
26 *
27 * Typically, the client of a datapath is the software switch module in
28 * "ovs-vswitchd", but other clients can be written. The "ovs-dpctl" utility
29 * is also a (simple) client.
30 *
31 *
32 * Overview
33 * ========
34 *
35 * The terms written in quotes below are defined in later sections.
36 *
37 * When a datapath "port" receives a packet, it extracts the headers (the
38 * "flow"). If the datapath's "flow table" contains a "flow entry" matching
39 * the packet, then it executes the "actions" in the flow entry and increments
40 * the flow's statistics. If there is no matching flow entry, the datapath
41 * instead appends the packet to an "upcall" queue.
42 *
43 *
44 * Ports
45 * =====
46 *
47 * A datapath has a set of ports that are analogous to the ports on an Ethernet
48 * switch. At the datapath level, each port has the following information
49 * associated with it:
50 *
51 * - A name, a short string that must be unique within the host. This is
52 * typically a name that would be familiar to the system administrator,
53 * e.g. "eth0" or "vif1.1", but it is otherwise arbitrary.
54 *
55 * - A 32-bit port number that must be unique within the datapath but is
56 * otherwise arbitrary. The port number is the most important identifier
57 * for a port in the datapath interface.
58 *
59 * - A type, a short string that identifies the kind of port. On a Linux
60 * host, typical types are "system" (for a network device such as eth0),
61 * "internal" (for a simulated port used to connect to the TCP/IP stack),
62 * and "gre" (for a GRE tunnel).
63 *
64 * - A Netlink PID for each upcall reading thread (see "Upcall Queuing and
65 * Ordering" below).
66 *
67 * The dpif interface has functions for adding and deleting ports. When a
68 * datapath implements these (e.g. as the Linux and netdev datapaths do), then
69 * Open vSwitch's ovs-vswitchd daemon can directly control what ports are used
70 * for switching. Some datapaths might not implement them, or implement them
71 * with restrictions on the types of ports that can be added or removed
72 * (e.g. on ESX), on systems where port membership can only be changed by some
73 * external entity.
74 *
75 * Each datapath must have a port, sometimes called the "local port", whose
76 * name is the same as the datapath itself, with port number 0. The local port
77 * cannot be deleted.
78 *
79 * Ports are available as "struct netdev"s. To obtain a "struct netdev *" for
80 * a port named 'name' with type 'port_type', in a datapath of type
81 * 'datapath_type', call netdev_open(name, dpif_port_open_type(datapath_type,
82 * port_type). The netdev can be used to get and set important data related to
83 * the port, such as:
84 *
85 * - MTU (netdev_get_mtu(), netdev_set_mtu()).
86 *
87 * - Ethernet address (netdev_get_etheraddr(), netdev_set_etheraddr()).
88 *
89 * - Statistics such as the number of packets and bytes transmitted and
90 * received (netdev_get_stats()).
91 *
92 * - Carrier status (netdev_get_carrier()).
93 *
94 * - Speed (netdev_get_features()).
95 *
96 * - QoS queue configuration (netdev_get_queue(), netdev_set_queue() and
97 * related functions.)
98 *
99 * - Arbitrary port-specific configuration parameters (netdev_get_config(),
100 * netdev_set_config()). An example of such a parameter is the IP
101 * endpoint for a GRE tunnel.
102 *
103 *
104 * Flow Table
105 * ==========
106 *
107 * The flow table is a collection of "flow entries". Each flow entry contains:
108 *
109 * - A "flow", that is, a summary of the headers in an Ethernet packet. The
110 * flow must be unique within the flow table. Flows are fine-grained
111 * entities that include L2, L3, and L4 headers. A single TCP connection
112 * consists of two flows, one in each direction.
113 *
114 * In Open vSwitch userspace, "struct flow" is the typical way to describe
115 * a flow, but the datapath interface uses a different data format to
116 * allow ABI forward- and backward-compatibility. Refer to OVS_KEY_ATTR_*
117 * and "struct ovs_key_*" in include/odp-netlink.h for details.
118 * lib/odp-util.h defines several functions for working with these flows.
119 *
120 * - A "mask" that, for each bit in the flow, specifies whether the datapath
121 * should consider the corresponding flow bit when deciding whether a
122 * given packet matches the flow entry. The original datapath design did
123 * not support matching: every flow entry was exact match. With the
124 * addition of a mask, the interface supports datapaths with a spectrum of
125 * wildcard matching capabilities, from those that only support exact
126 * matches to those that support bitwise wildcarding on the entire flow
127 * key, as well as datapaths with capabilities somewhere in between.
128 *
129 * Datapaths do not provide a way to query their wildcarding capabilities,
130 * nor is it expected that the client should attempt to probe for the
131 * details of their support. Instead, a client installs flows with masks
132 * that wildcard as many bits as acceptable. The datapath then actually
133 * wildcards as many of those bits as it can and changes the wildcard bits
134 * that it does not support into exact match bits. A datapath that can
135 * wildcard any bit, for example, would install the supplied mask, an
136 * exact-match only datapath would install an exact-match mask regardless
137 * of what mask the client supplied, and a datapath in the middle of the
138 * spectrum would selectively change some wildcard bits into exact match
139 * bits.
140 *
141 * Regardless of the requested or installed mask, the datapath retains the
142 * original flow supplied by the client. (It does not, for example, "zero
143 * out" the wildcarded bits.) This allows the client to unambiguously
144 * identify the flow entry in later flow table operations.
145 *
146 * The flow table does not have priorities; that is, all flow entries have
147 * equal priority. Detecting overlapping flow entries is expensive in
148 * general, so the datapath is not required to do it. It is primarily the
149 * client's responsibility not to install flow entries whose flow and mask
150 * combinations overlap.
151 *
152 * - A list of "actions" that tell the datapath what to do with packets
153 * within a flow. Some examples of actions are OVS_ACTION_ATTR_OUTPUT,
154 * which transmits the packet out a port, and OVS_ACTION_ATTR_SET, which
155 * modifies packet headers. Refer to OVS_ACTION_ATTR_* and "struct
156 * ovs_action_*" in include/odp-netlink.h for details. lib/odp-util.h
157 * defines several functions for working with datapath actions.
158 *
159 * The actions list may be empty. This indicates that nothing should be
160 * done to matching packets, that is, they should be dropped.
161 *
162 * (In case you are familiar with OpenFlow, datapath actions are analogous
163 * to OpenFlow actions.)
164 *
165 * - Statistics: the number of packets and bytes that the flow has
166 * processed, the last time that the flow processed a packet, and the
167 * union of all the TCP flags in packets processed by the flow. (The
168 * latter is 0 if the flow is not a TCP flow.)
169 *
170 * The datapath's client manages the flow table, primarily in reaction to
171 * "upcalls" (see below).
172 *
173 *
174 * Upcalls
175 * =======
176 *
177 * A datapath sometimes needs to notify its client that a packet was received.
178 * The datapath mechanism to do this is called an "upcall".
179 *
180 * Upcalls are used in two situations:
181 *
182 * - When a packet is received, but there is no matching flow entry in its
183 * flow table (a flow table "miss"), this causes an upcall of type
184 * DPIF_UC_MISS. These are called "miss" upcalls.
185 *
186 * - A datapath action of type OVS_ACTION_ATTR_USERSPACE causes an upcall of
187 * type DPIF_UC_ACTION. These are called "action" upcalls.
188 *
189 * An upcall contains an entire packet. There is no attempt to, e.g., copy
190 * only as much of the packet as normally needed to make a forwarding decision.
191 * Such an optimization is doable, but experimental prototypes showed it to be
192 * of little benefit because an upcall typically contains the first packet of a
193 * flow, which is usually short (e.g. a TCP SYN). Also, the entire packet can
194 * sometimes really be needed.
195 *
196 * After a client reads a given upcall, the datapath is finished with it, that
197 * is, the datapath doesn't maintain any lingering state past that point.
198 *
199 * The latency from the time that a packet arrives at a port to the time that
200 * it is received from dpif_recv() is critical in some benchmarks. For
201 * example, if this latency is 1 ms, then a netperf TCP_CRR test, which opens
202 * and closes TCP connections one at a time as quickly as it can, cannot
203 * possibly achieve more than 500 transactions per second, since every
204 * connection consists of two flows with 1-ms latency to set up each one.
205 *
206 * To receive upcalls, a client has to enable them with dpif_recv_set(). A
207 * datapath should generally support being opened multiple times (e.g. so that
208 * one may run "ovs-dpctl show" or "ovs-dpctl dump-flows" while "ovs-vswitchd"
209 * is also running) but need not support more than one of these clients
210 * enabling upcalls at once.
211 *
212 *
213 * Upcall Queuing and Ordering
214 * ---------------------------
215 *
216 * The datapath's client reads upcalls one at a time by calling dpif_recv().
217 * When more than one upcall is pending, the order in which the datapath
218 * presents upcalls to its client is important. The datapath's client does not
219 * directly control this order, so the datapath implementer must take care
220 * during design.
221 *
222 * The minimal behavior, suitable for initial testing of a datapath
223 * implementation, is that all upcalls are appended to a single queue, which is
224 * delivered to the client in order.
225 *
226 * The datapath should ensure that a high rate of upcalls from one particular
227 * port cannot cause upcalls from other sources to be dropped or unreasonably
228 * delayed. Otherwise, one port conducting a port scan or otherwise initiating
229 * high-rate traffic spanning many flows could suppress other traffic.
230 * Ideally, the datapath should present upcalls from each port in a "round
231 * robin" manner, to ensure fairness.
232 *
233 * The client has no control over "miss" upcalls and no insight into the
234 * datapath's implementation, so the datapath is entirely responsible for
235 * queuing and delivering them. On the other hand, the datapath has
236 * considerable freedom of implementation. One good approach is to maintain a
237 * separate queue for each port, to prevent any given port's upcalls from
238 * interfering with other ports' upcalls. If this is impractical, then another
239 * reasonable choice is to maintain some fixed number of queues and assign each
240 * port to one of them. Ports assigned to the same queue can then interfere
241 * with each other, but not with ports assigned to different queues. Other
242 * approaches are also possible.
243 *
244 * The client has some control over "action" upcalls: it can specify a 32-bit
245 * "Netlink PID" as part of the action. This terminology comes from the Linux
246 * datapath implementation, which uses a protocol called Netlink in which a PID
247 * designates a particular socket and the upcall data is delivered to the
248 * socket's receive queue. Generically, though, a Netlink PID identifies a
249 * queue for upcalls. The basic requirements on the datapath are:
250 *
251 * - The datapath must provide a Netlink PID associated with each port. The
252 * client can retrieve the PID with dpif_port_get_pid().
253 *
254 * - The datapath must provide a "special" Netlink PID not associated with
255 * any port. dpif_port_get_pid() also provides this PID. (ovs-vswitchd
256 * uses this PID to queue special packets that must not be lost even if a
257 * port is otherwise busy, such as packets used for tunnel monitoring.)
258 *
259 * The minimal behavior of dpif_port_get_pid() and the treatment of the Netlink
260 * PID in "action" upcalls is that dpif_port_get_pid() returns a constant value
261 * and all upcalls are appended to a single queue.
262 *
263 * The preferred behavior is:
264 *
265 * - Each port has a PID that identifies the queue used for "miss" upcalls
266 * on that port. (Thus, if each port has its own queue for "miss"
267 * upcalls, then each port has a different Netlink PID.)
268 *
269 * - "miss" upcalls for a given port and "action" upcalls that specify that
270 * port's Netlink PID add their upcalls to the same queue. The upcalls
271 * are delivered to the datapath's client in the order that the packets
272 * were received, regardless of whether the upcalls are "miss" or "action"
273 * upcalls.
274 *
275 * - Upcalls that specify the "special" Netlink PID are queued separately.
276 *
277 * Multiple threads may want to read upcalls simultaneously from a single
278 * datapath. To support multiple threads well, one extends the above preferred
279 * behavior:
280 *
281 * - Each port has multiple PIDs. The datapath distributes "miss" upcalls
282 * across the PIDs, ensuring that a given flow is mapped in a stable way
283 * to a single PID.
284 *
285 * - For "action" upcalls, the thread can specify its own Netlink PID or
286 * other threads' Netlink PID of the same port for offloading purpose
287 * (e.g. in a "round robin" manner).
288 *
289 *
290 * Packet Format
291 * =============
292 *
293 * The datapath interface works with packets in a particular form. This is the
294 * form taken by packets received via upcalls (i.e. by dpif_recv()). Packets
295 * supplied to the datapath for processing (i.e. to dpif_execute()) also take
296 * this form.
297 *
298 * A VLAN tag is represented by an 802.1Q header. If the layer below the
299 * datapath interface uses another representation, then the datapath interface
300 * must perform conversion.
301 *
302 * The datapath interface requires all packets to fit within the MTU. Some
303 * operating systems internally process packets larger than MTU, with features
304 * such as TSO and UFO. When such a packet passes through the datapath
305 * interface, it must be broken into multiple MTU or smaller sized packets for
306 * presentation as upcalls. (This does not happen often, because an upcall
307 * typically contains the first packet of a flow, which is usually short.)
308 *
309 * Some operating system TCP/IP stacks maintain packets in an unchecksummed or
310 * partially checksummed state until transmission. The datapath interface
311 * requires all host-generated packets to be fully checksummed (e.g. IP and TCP
312 * checksums must be correct). On such an OS, the datapath interface must fill
313 * in these checksums.
314 *
315 * Packets passed through the datapath interface must be at least 14 bytes
316 * long, that is, they must have a complete Ethernet header. They are not
317 * required to be padded to the minimum Ethernet length.
318 *
319 *
320 * Typical Usage
321 * =============
322 *
323 * Typically, the client of a datapath begins by configuring the datapath with
324 * a set of ports. Afterward, the client runs in a loop polling for upcalls to
325 * arrive.
326 *
327 * For each upcall received, the client examines the enclosed packet and
328 * figures out what should be done with it. For example, if the client
329 * implements a MAC-learning switch, then it searches the forwarding database
330 * for the packet's destination MAC and VLAN and determines the set of ports to
331 * which it should be sent. In any case, the client composes a set of datapath
332 * actions to properly dispatch the packet and then directs the datapath to
333 * execute those actions on the packet (e.g. with dpif_execute()).
334 *
335 * Most of the time, the actions that the client executed on the packet apply
336 * to every packet with the same flow. For example, the flow includes both
337 * destination MAC and VLAN ID (and much more), so this is true for the
338 * MAC-learning switch example above. In such a case, the client can also
339 * direct the datapath to treat any further packets in the flow in the same
340 * way, using dpif_flow_put() to add a new flow entry.
341 *
342 * Other tasks the client might need to perform, in addition to reacting to
343 * upcalls, include:
344 *
345 * - Periodically polling flow statistics, perhaps to supply to its own
346 * clients.
347 *
348 * - Deleting flow entries from the datapath that haven't been used
349 * recently, to save memory.
350 *
351 * - Updating flow entries whose actions should change. For example, if a
352 * MAC learning switch learns that a MAC has moved, then it must update
353 * the actions of flow entries that sent packets to the MAC at its old
354 * location.
355 *
356 * - Adding and removing ports to achieve a new configuration.
357 *
358 *
359 * Thread-safety
360 * =============
361 *
362 * Most of the dpif functions are fully thread-safe: they may be called from
363 * any number of threads on the same or different dpif objects. The exceptions
364 * are:
365 *
366 * - dpif_port_poll() and dpif_port_poll_wait() are conditionally
367 * thread-safe: they may be called from different threads only on
368 * different dpif objects.
369 *
370 * - dpif_flow_dump_next() is conditionally thread-safe: It may be called
371 * from different threads with the same 'struct dpif_flow_dump', but all
372 * other parameters must be different for each thread.
373 *
374 * - dpif_flow_dump_done() is conditionally thread-safe: All threads that
375 * share the same 'struct dpif_flow_dump' must have finished using it.
376 * This function must then be called exactly once for a particular
377 * dpif_flow_dump to finish the corresponding flow dump operation.
378 *
379 * - Functions that operate on 'struct dpif_port_dump' are conditionally
380 * thread-safe with respect to those objects. That is, one may dump ports
381 * from any number of threads at once, but each thread must use its own
382 * struct dpif_port_dump.
383 */
384 #ifndef DPIF_H
385 #define DPIF_H 1
386
387 #include <stdbool.h>
388 #include <stddef.h>
389 #include <stdint.h>
390
391 #include "dpdk.h"
392 #include "dp-packet.h"
393 #include "netdev.h"
394 #include "openflow/openflow.h"
395 #include "openvswitch/ofp-meter.h"
396 #include "ovs-numa.h"
397 #include "packets.h"
398 #include "util.h"
399
400 #ifdef __cplusplus
401 extern "C" {
402 #endif
403
404 struct dpif;
405 struct dpif_class;
406 struct dpif_flow;
407 struct ds;
408 struct flow;
409 struct flow_wildcards;
410 struct nlattr;
411 struct sset;
412
413 int dp_register_provider(const struct dpif_class *);
414 int dp_unregister_provider(const char *type);
415 void dp_blacklist_provider(const char *type);
416 void dp_enumerate_types(struct sset *types);
417 const char *dpif_normalize_type(const char *);
418
419 int dp_enumerate_names(const char *type, struct sset *names);
420 void dp_parse_name(const char *datapath_name, char **name, char **type);
421
422 int dpif_open(const char *name, const char *type, struct dpif **);
423 int dpif_create(const char *name, const char *type, struct dpif **);
424 int dpif_create_and_open(const char *name, const char *type, struct dpif **);
425 void dpif_close(struct dpif *);
426
427 bool dpif_run(struct dpif *);
428 void dpif_wait(struct dpif *);
429
430 const char *dpif_name(const struct dpif *);
431 const char *dpif_base_name(const struct dpif *);
432 const char *dpif_type(const struct dpif *);
433
434 int dpif_delete(struct dpif *);
435
436 /* Statistics for a dpif as a whole. */
437 struct dpif_dp_stats {
438 uint64_t n_hit; /* Number of flow table matches. */
439 uint64_t n_missed; /* Number of flow table misses. */
440 uint64_t n_lost; /* Number of misses not sent to userspace. */
441 uint64_t n_flows; /* Number of flows present. */
442 uint64_t n_mask_hit; /* Number of mega flow masks visited for
443 flow table matches. */
444 uint32_t n_masks; /* Number of mega flow masks. */
445 };
446 int dpif_get_dp_stats(const struct dpif *, struct dpif_dp_stats *);
447
448 \f
449 /* Port operations. */
450
451 const char *dpif_port_open_type(const char *datapath_type,
452 const char *port_type);
453 int dpif_port_add(struct dpif *, struct netdev *, odp_port_t *port_nop);
454 int dpif_port_del(struct dpif *, odp_port_t port_no, bool local_delete);
455
456 /* A port within a datapath.
457 *
458 * 'name' and 'type' are suitable for passing to netdev_open(). */
459 struct dpif_port {
460 char *name; /* Network device name, e.g. "eth0". */
461 char *type; /* Network device type, e.g. "system". */
462 odp_port_t port_no; /* Port number within datapath. */
463 };
464 void dpif_port_clone(struct dpif_port *, const struct dpif_port *);
465 void dpif_port_destroy(struct dpif_port *);
466 bool dpif_port_exists(const struct dpif *dpif, const char *devname);
467 int dpif_port_query_by_number(const struct dpif *, odp_port_t port_no,
468 struct dpif_port *);
469 int dpif_port_query_by_name(const struct dpif *, const char *devname,
470 struct dpif_port *);
471 int dpif_port_get_name(struct dpif *, odp_port_t port_no,
472 char *name, size_t name_size);
473 uint32_t dpif_port_get_pid(const struct dpif *, odp_port_t port_no,
474 uint32_t hash);
475
476 struct dpif_port_dump {
477 const struct dpif *dpif;
478 int error;
479 void *state;
480 };
481 void dpif_port_dump_start(struct dpif_port_dump *, const struct dpif *);
482 bool dpif_port_dump_next(struct dpif_port_dump *, struct dpif_port *);
483 int dpif_port_dump_done(struct dpif_port_dump *);
484
485 /* Iterates through each DPIF_PORT in DPIF, using DUMP as state.
486 *
487 * Arguments all have pointer type.
488 *
489 * If you break out of the loop, then you need to free the dump structure by
490 * hand using dpif_port_dump_done(). */
491 #define DPIF_PORT_FOR_EACH(DPIF_PORT, DUMP, DPIF) \
492 for (dpif_port_dump_start(DUMP, DPIF); \
493 (dpif_port_dump_next(DUMP, DPIF_PORT) \
494 ? true \
495 : (dpif_port_dump_done(DUMP), false)); \
496 )
497
498 int dpif_port_poll(const struct dpif *, char **devnamep);
499 void dpif_port_poll_wait(const struct dpif *);
500 \f
501 /* Flow table operations. */
502
503 struct dpif_flow_stats {
504 uint64_t n_packets;
505 uint64_t n_bytes;
506 long long int used;
507 uint16_t tcp_flags;
508 };
509
510 void dpif_flow_stats_extract(const struct flow *, const struct dp_packet *packet,
511 long long int used, struct dpif_flow_stats *);
512 void dpif_flow_stats_format(const struct dpif_flow_stats *, struct ds *);
513
514 enum dpif_flow_put_flags {
515 DPIF_FP_CREATE = 1 << 0, /* Allow creating a new flow. */
516 DPIF_FP_MODIFY = 1 << 1, /* Allow modifying an existing flow. */
517 DPIF_FP_ZERO_STATS = 1 << 2, /* Zero the stats of an existing flow. */
518 DPIF_FP_PROBE = 1 << 3 /* Suppress error messages, if any. */
519 };
520
521 bool dpif_probe_feature(struct dpif *, const char *name,
522 const struct ofpbuf *key, const struct ofpbuf *actions,
523 const ovs_u128 *ufid);
524 void dpif_flow_hash(const struct dpif *, const void *key, size_t key_len,
525 ovs_u128 *hash);
526 int dpif_flow_flush(struct dpif *);
527 int dpif_flow_put(struct dpif *, enum dpif_flow_put_flags,
528 const struct nlattr *key, size_t key_len,
529 const struct nlattr *mask, size_t mask_len,
530 const struct nlattr *actions, size_t actions_len,
531 const ovs_u128 *ufid, const unsigned pmd_id,
532 struct dpif_flow_stats *);
533 int dpif_flow_del(struct dpif *,
534 const struct nlattr *key, size_t key_len,
535 const ovs_u128 *ufid, const unsigned pmd_id,
536 struct dpif_flow_stats *);
537 int dpif_flow_get(struct dpif *,
538 const struct nlattr *key, size_t key_len,
539 const ovs_u128 *ufid, const unsigned pmd_id,
540 struct ofpbuf *, struct dpif_flow *);
541 \f
542 /* Flow dumping interface
543 * ======================
544 *
545 * This interface allows iteration through all of the flows currently installed
546 * in a datapath. It is somewhat complicated by two requirements:
547 *
548 * - Efficient support for dumping flows in parallel from multiple threads.
549 *
550 * - Allow callers to avoid making unnecessary copies of data returned by
551 * the interface across several flows in cases where the dpif
552 * implementation has to maintain a copy of that information anyhow.
553 * (That is, allow the client visibility into any underlying batching as
554 * part of its own batching.)
555 *
556 *
557 * Usage
558 * -----
559 *
560 * 1. Call dpif_flow_dump_create().
561 * 2. In each thread that participates in the dump (which may be just a single
562 * thread if parallelism isn't important):
563 * (a) Call dpif_flow_dump_thread_create().
564 * (b) Call dpif_flow_dump_next() repeatedly until it returns 0.
565 * (c) Call dpif_flow_dump_thread_destroy().
566 * 3. Call dpif_flow_dump_destroy().
567 *
568 * All error reporting is deferred to the call to dpif_flow_dump_destroy().
569 */
570 struct dpif_flow_dump *dpif_flow_dump_create(const struct dpif *, bool terse,
571 char *type);
572 int dpif_flow_dump_destroy(struct dpif_flow_dump *);
573
574 struct dpif_flow_dump_thread *dpif_flow_dump_thread_create(
575 struct dpif_flow_dump *);
576 void dpif_flow_dump_thread_destroy(struct dpif_flow_dump_thread *);
577
578 #define PMD_ID_NULL OVS_CORE_UNSPEC
579
580 /* A datapath flow as dumped by dpif_flow_dump_next(). */
581 struct dpif_flow {
582 const struct nlattr *key; /* Flow key, as OVS_KEY_ATTR_* attrs. */
583 size_t key_len; /* 'key' length in bytes. */
584 const struct nlattr *mask; /* Flow mask, as OVS_KEY_ATTR_* attrs. */
585 size_t mask_len; /* 'mask' length in bytes. */
586 const struct nlattr *actions; /* Actions, as OVS_ACTION_ATTR_ */
587 size_t actions_len; /* 'actions' length in bytes. */
588 ovs_u128 ufid; /* Unique flow identifier. */
589 bool ufid_present; /* True if 'ufid' was provided by datapath.*/
590 unsigned pmd_id; /* Datapath poll mode driver id. */
591 struct dpif_flow_stats stats; /* Flow statistics. */
592 bool offloaded; /* True if flow is offloaded */
593 };
594 int dpif_flow_dump_next(struct dpif_flow_dump_thread *,
595 struct dpif_flow *flows, int max_flows);
596
597 #define DPIF_FLOW_BUFSIZE 2048
598 \f
599 /* Operation batching interface.
600 *
601 * Some datapaths are faster at performing N operations together than the same
602 * N operations individually, hence an interface for batching.
603 */
604
605 enum dpif_op_type {
606 DPIF_OP_FLOW_PUT = 1,
607 DPIF_OP_FLOW_DEL,
608 DPIF_OP_EXECUTE,
609 DPIF_OP_FLOW_GET,
610 };
611
612 /* Add or modify a flow.
613 *
614 * The flow is specified by the Netlink attributes with types OVS_KEY_ATTR_* in
615 * the 'key_len' bytes starting at 'key'. The associated actions are specified
616 * by the Netlink attributes with types OVS_ACTION_ATTR_* in the 'actions_len'
617 * bytes starting at 'actions'.
618 *
619 * - If the flow's key does not exist in the dpif, then the flow will be
620 * added if 'flags' includes DPIF_FP_CREATE. Otherwise the operation will
621 * fail with ENOENT.
622 *
623 * If the operation succeeds, then 'stats', if nonnull, will be zeroed.
624 *
625 * - If the flow's key does exist in the dpif, then the flow's actions will
626 * be updated if 'flags' includes DPIF_FP_MODIFY. Otherwise the operation
627 * will fail with EEXIST. If the flow's actions are updated, then its
628 * statistics will be zeroed if 'flags' includes DPIF_FP_ZERO_STATS, and
629 * left as-is otherwise.
630 *
631 * If the operation succeeds, then 'stats', if nonnull, will be set to the
632 * flow's statistics before the update.
633 *
634 * - If the datapath implements multiple pmd thread with its own flow
635 * table, 'pmd_id' should be used to specify the particular polling
636 * thread for the operation. PMD_ID_NULL means that the flow should
637 * be put on all the polling threads.
638 */
639 struct dpif_flow_put {
640 /* Input. */
641 enum dpif_flow_put_flags flags; /* DPIF_FP_*. */
642 const struct nlattr *key; /* Flow to put. */
643 size_t key_len; /* Length of 'key' in bytes. */
644 const struct nlattr *mask; /* Mask to put. */
645 size_t mask_len; /* Length of 'mask' in bytes. */
646 const struct nlattr *actions; /* Actions to perform on flow. */
647 size_t actions_len; /* Length of 'actions' in bytes. */
648 const ovs_u128 *ufid; /* Optional unique flow identifier. */
649 unsigned pmd_id; /* Datapath poll mode driver id. */
650
651 /* Output. */
652 struct dpif_flow_stats *stats; /* Optional flow statistics. */
653 };
654
655 /* Delete a flow.
656 *
657 * The flow is specified by the Netlink attributes with types OVS_KEY_ATTR_* in
658 * the 'key_len' bytes starting at 'key', or the unique identifier 'ufid'. If
659 * the flow was created using 'ufid', then 'ufid' must be specified to delete
660 * the flow. If both are specified, 'key' will be ignored for flow deletion.
661 * Succeeds with status 0 if the flow is deleted, or fails with ENOENT if the
662 * dpif does not contain such a flow.
663 *
664 * Callers should always provide the 'key' to improve dpif logging in the event
665 * of errors or unexpected behaviour.
666 *
667 * If the datapath implements multiple polling thread with its own flow table,
668 * 'pmd_id' should be used to specify the particular polling thread for the
669 * operation. PMD_ID_NULL means that the flow should be deleted from all the
670 * polling threads.
671 *
672 * If the operation succeeds, then 'stats', if nonnull, will be set to the
673 * flow's statistics before its deletion. */
674 struct dpif_flow_del {
675 /* Input. */
676 const struct nlattr *key; /* Flow to delete. */
677 size_t key_len; /* Length of 'key' in bytes. */
678 const ovs_u128 *ufid; /* Unique identifier of flow to delete. */
679 bool terse; /* OK to skip sending/receiving full flow
680 * info? */
681 unsigned pmd_id; /* Datapath poll mode driver id. */
682
683 /* Output. */
684 struct dpif_flow_stats *stats; /* Optional flow statistics. */
685 };
686
687 /* Executes actions on a specified packet.
688 *
689 * Performs the 'actions_len' bytes of actions in 'actions' on the Ethernet
690 * frame in 'packet' and on the packet metadata in 'md'. May modify both
691 * 'packet' and 'md'.
692 *
693 * Some dpif providers do not implement every action. The Linux kernel
694 * datapath, in particular, does not implement ARP field modification. If
695 * 'needs_help' is true, the dpif layer executes in userspace all of the
696 * actions that it can, and for OVS_ACTION_ATTR_OUTPUT and
697 * OVS_ACTION_ATTR_USERSPACE actions it passes the packet through to the dpif
698 * implementation.
699 *
700 * This works even if 'actions_len' is too long for a Netlink attribute. */
701 struct dpif_execute {
702 /* Input. */
703 const struct nlattr *actions; /* Actions to execute on packet. */
704 size_t actions_len; /* Length of 'actions' in bytes. */
705 bool needs_help;
706 bool probe; /* Suppress error messages. */
707 unsigned int mtu; /* Maximum transmission unit to fragment.
708 0 if not a fragmented packet */
709 const struct flow *flow; /* Flow extracted from 'packet'. */
710
711 /* Input, but possibly modified as a side effect of execution. */
712 struct dp_packet *packet; /* Packet to execute. */
713 };
714
715 /* Queries the dpif for a flow entry.
716 *
717 * The flow is specified by the Netlink attributes with types OVS_KEY_ATTR_* in
718 * the 'key_len' bytes starting at 'key', or the unique identifier 'ufid'. If
719 * the flow was created using 'ufid', then 'ufid' must be specified to fetch
720 * the flow. If both are specified, 'key' will be ignored for the flow query.
721 * 'buffer' must point to an initialized buffer, with a recommended size of
722 * DPIF_FLOW_BUFSIZE bytes.
723 *
724 * On success, 'flow' will be populated with the mask, actions and stats for
725 * the datapath flow corresponding to 'key'. The mask and actions may point
726 * within '*buffer', or may point at RCU-protected data. Therefore, callers
727 * that wish to hold these over quiescent periods must make a copy of these
728 * fields before quiescing.
729 *
730 * Callers should always provide 'key' to improve dpif logging in the event of
731 * errors or unexpected behaviour.
732 *
733 * If the datapath implements multiple polling thread with its own flow table,
734 * 'pmd_id' should be used to specify the particular polling thread for the
735 * operation. PMD_ID_NULL means that the datapath will return the first
736 * matching flow from any poll thread.
737 *
738 * Succeeds with status 0 if the flow is fetched, or fails with ENOENT if no
739 * such flow exists. Other failures are indicated with a positive errno value.
740 */
741 struct dpif_flow_get {
742 /* Input. */
743 const struct nlattr *key; /* Flow to get. */
744 size_t key_len; /* Length of 'key' in bytes. */
745 const ovs_u128 *ufid; /* Unique identifier of flow to get. */
746 unsigned pmd_id; /* Datapath poll mode driver id. */
747 struct ofpbuf *buffer; /* Storage for output parameters. */
748
749 /* Output. */
750 struct dpif_flow *flow; /* Resulting flow from datapath. */
751 };
752
753 int dpif_execute(struct dpif *, struct dpif_execute *);
754
755 struct dpif_op {
756 enum dpif_op_type type;
757 int error;
758 union {
759 struct dpif_flow_put flow_put;
760 struct dpif_flow_del flow_del;
761 struct dpif_execute execute;
762 struct dpif_flow_get flow_get;
763 } u;
764 };
765
766 void dpif_operate(struct dpif *, struct dpif_op **ops, size_t n_ops);
767 \f
768 /* Upcalls. */
769
770 enum dpif_upcall_type {
771 DPIF_UC_MISS, /* Miss in flow table. */
772 DPIF_UC_ACTION, /* OVS_ACTION_ATTR_USERSPACE action. */
773 DPIF_N_UC_TYPES
774 };
775
776 const char *dpif_upcall_type_to_string(enum dpif_upcall_type);
777
778 /* A packet passed up from the datapath to userspace.
779 *
780 * The 'packet', 'key' and 'userdata' may point into data in a buffer
781 * provided by the caller, so the buffer should be released only after the
782 * upcall processing has been finished.
783 *
784 * While being processed, the 'packet' may be reallocated, so the packet must
785 * be separately released with ofpbuf_uninit().
786 */
787 struct dpif_upcall {
788 /* All types. */
789 struct dp_packet packet; /* Packet data,'dp_packet' should be the first
790 member to avoid a hole. This is because
791 'rte_mbuf' in dp_packet is aligned atleast
792 on a 64-byte boundary */
793 enum dpif_upcall_type type;
794 struct nlattr *key; /* Flow key. */
795 size_t key_len; /* Length of 'key' in bytes. */
796 ovs_u128 ufid; /* Unique flow identifier for 'key'. */
797 struct nlattr *mru; /* Maximum receive unit. */
798 struct nlattr *cutlen; /* Number of bytes shrink from the end. */
799
800 /* DPIF_UC_ACTION only. */
801 struct nlattr *userdata; /* Argument to OVS_ACTION_ATTR_USERSPACE. */
802 struct nlattr *out_tun_key; /* Output tunnel key. */
803 struct nlattr *actions; /* Argument to OVS_ACTION_ATTR_USERSPACE. */
804 };
805
806 /* A callback to notify higher layer of dpif about to be purged, so that
807 * higher layer could try reacting to this (e.g. grabbing all flow stats
808 * before they are gone). This function is currently implemented only by
809 * dpif-netdev.
810 *
811 * The caller needs to provide the 'aux' pointer passed down by higher
812 * layer from the dpif_register_notify_cb() function and the 'pmd_id' of
813 * the polling thread.
814 */
815 typedef void dp_purge_callback(void *aux, unsigned pmd_id);
816
817 void dpif_register_dp_purge_cb(struct dpif *, dp_purge_callback *, void *aux);
818
819 /* A callback to process an upcall, currently implemented only by dpif-netdev.
820 *
821 * The caller provides the 'packet' and 'flow' to process, the corresponding
822 * 'ufid' as generated by dpif_flow_hash(), the polling thread id 'pmd_id',
823 * the 'type' of the upcall, and if 'type' is DPIF_UC_ACTION then the
824 * 'userdata' attached to the action.
825 *
826 * The callback must fill in 'actions' with the datapath actions to apply to
827 * 'packet'. 'wc' and 'put_actions' will either be both null or both nonnull.
828 * If they are nonnull, then the caller will install a flow entry to process
829 * all future packets that match 'flow' and 'wc'; the callback must store a
830 * wildcard mask suitable for that purpose into 'wc'. If the actions to store
831 * into the flow entry are the same as 'actions', then the callback may leave
832 * 'put_actions' empty; otherwise it must store the desired actions into
833 * 'put_actions'.
834 *
835 * Returns 0 if successful, ENOSPC if the flow limit has been reached and no
836 * flow should be installed, or some otherwise a positive errno value. */
837 typedef int upcall_callback(const struct dp_packet *packet,
838 const struct flow *flow,
839 ovs_u128 *ufid,
840 unsigned pmd_id,
841 enum dpif_upcall_type type,
842 const struct nlattr *userdata,
843 struct ofpbuf *actions,
844 struct flow_wildcards *wc,
845 struct ofpbuf *put_actions,
846 void *aux);
847
848 void dpif_register_upcall_cb(struct dpif *, upcall_callback *, void *aux);
849
850 int dpif_recv_set(struct dpif *, bool enable);
851 int dpif_handlers_set(struct dpif *, uint32_t n_handlers);
852 int dpif_set_config(struct dpif *, const struct smap *cfg);
853 int dpif_port_set_config(struct dpif *, odp_port_t, const struct smap *cfg);
854 int dpif_recv(struct dpif *, uint32_t handler_id, struct dpif_upcall *,
855 struct ofpbuf *);
856 void dpif_recv_purge(struct dpif *);
857 void dpif_recv_wait(struct dpif *, uint32_t handler_id);
858 void dpif_enable_upcall(struct dpif *);
859 void dpif_disable_upcall(struct dpif *);
860
861 void dpif_print_packet(struct dpif *, struct dpif_upcall *);
862 \f
863 /* Meters. */
864 void dpif_meter_get_features(const struct dpif *,
865 struct ofputil_meter_features *);
866 int dpif_meter_set(struct dpif *, ofproto_meter_id *meter_id,
867 struct ofputil_meter_config *);
868 int dpif_meter_get(const struct dpif *, ofproto_meter_id meter_id,
869 struct ofputil_meter_stats *, uint16_t n_bands);
870 int dpif_meter_del(struct dpif *, ofproto_meter_id meter_id,
871 struct ofputil_meter_stats *, uint16_t n_bands);
872 \f
873 /* Miscellaneous. */
874
875 void dpif_get_netflow_ids(const struct dpif *,
876 uint8_t *engine_type, uint8_t *engine_id);
877
878 int dpif_queue_to_priority(const struct dpif *, uint32_t queue_id,
879 uint32_t *priority);
880
881 int dpif_get_pmds_for_port(const struct dpif * dpif, odp_port_t port_no,
882 unsigned int **pmds, size_t *n);
883
884 char *dpif_get_dp_version(const struct dpif *);
885 bool dpif_supports_tnl_push_pop(const struct dpif *);
886
887 /* Log functions. */
888 struct vlog_module;
889
890 void log_flow_message(const struct dpif *dpif, int error,
891 const struct vlog_module *module,
892 const char *operation,
893 const struct nlattr *key, size_t key_len,
894 const struct nlattr *mask, size_t mask_len,
895 const ovs_u128 *ufid,
896 const struct dpif_flow_stats *stats,
897 const struct nlattr *actions, size_t actions_len);
898 void log_flow_put_message(const struct dpif *,
899 const struct vlog_module *,
900 const struct dpif_flow_put *,
901 int error);
902 void log_flow_del_message(const struct dpif *,
903 const struct vlog_module *,
904 const struct dpif_flow_del *,
905 int error);
906 void log_execute_message(const struct dpif *,
907 const struct vlog_module *,
908 const struct dpif_execute *,
909 bool subexecute, int error);
910 void log_flow_get_message(const struct dpif *,
911 const struct vlog_module *,
912 const struct dpif_flow_get *,
913 int error);
914 #ifdef __cplusplus
915 }
916 #endif
917
918 #endif /* dpif.h */