#ifndef TABLE_H
#define TABLE_H 1
+#include <stddef.h>
#include <stdint.h>
struct sw_flow;
struct sw_flow_key;
-struct ofp_action;
+struct ofp_action_header;
struct list;
/* Table statistics. */
supported by the table. */
unsigned int n_flows; /* Number of active flows. */
unsigned int max_flows; /* Flow capacity. */
+ unsigned long int n_lookup; /* Number of packets looked up. */
unsigned long int n_matched; /* Number of packets that have hit. */
};
/* A single table of flows. */
struct sw_table {
- /* Keep track of the number of packets that matched this table. To
- * make this 100% accurate, it should be atomic. However, we're
- * primarily concerned about speed. */
- unsigned long int n_matched;
+ /* The number of packets that have been looked up and matched,
+ * respecitvely. To make these 100% accurate, they should be atomic.
+ * However, we're primarily concerned about speed. */
+ unsigned long long n_lookup;
+ unsigned long long n_matched;
/* Searches 'table' for a flow matching 'key', which must not have any
* wildcard fields. Returns the flow if successful, a null pointer
* retained by the caller. */
int (*insert)(struct sw_table *table, struct sw_flow *flow);
- /* Modifies entries in 'table' that match 'key'. Returns the
- * number of flows that were modified. */
+ /* Modifies the actions in 'table' that match 'key'. If 'strict'
+ * set, wildcards and priority must match. Returns the number of flows
+ * that were modified. */
int (*modify)(struct sw_table *table, const struct sw_flow_key *key,
- const struct ofp_action *actions, int n_actions);
+ uint16_t priority, int strict,
+ const struct ofp_action_header *actions, size_t actions_len);
/* Deletes from 'table' any and all flows that match 'key' from
* 'table'. If 'strict' set, wildcards must match. Returns the