lib/classifier.h

   1 /*
   2  * Copyright (c) 2009, 2010, 2011, 2012, 2013 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 #ifndef CLASSIFIER_H
  18 #define CLASSIFIER_H 1
  19
  20 /* Flow classifier.
  21  *
  22  *
  23  * What?
  24  * =====
  25  *
  26  * A flow classifier holds any number of "rules", each of which specifies
  27  * values to match for some fields or subfields and a priority.  The primary
  28  * design goal for the classifier is that, given a packet, it can as quickly as
  29  * possible find the highest-priority rule that matches the packet.
  30  *
  31  * Each OpenFlow table is implemented as a flow classifier.
  32  *
  33  *
  34  * Basic Design
  35  * ============
  36  *
  37  * Suppose that all the rules in a classifier had the same form.  For example,
  38  * suppose that they all matched on the source and destination Ethernet address
  39  * and wildcarded all the other fields.  Then the obvious way to implement a
  40  * classifier would be a hash table on the source and destination Ethernet
  41  * addresses.  If new classification rules came along with a different form,
  42  * you could add a second hash table that hashed on the fields matched in those
  43  * rules.  With two hash tables, you look up a given flow in each hash table.
  44  * If there are no matches, the classifier didn't contain a match; if you find
  45  * a match in one of them, that's the result; if you find a match in both of
  46  * them, then the result is the rule with the higher priority.
  47  *
  48  * This is how the classifier works.  In a "struct classifier", each form of
  49  * "struct cls_rule" present (based on its ->match.mask) goes into a separate
  50  * "struct cls_subtable".  A lookup does a hash lookup in every "struct
  51  * cls_subtable" in the classifier and tracks the highest-priority match that
  52  * it finds.  The subtables are kept in a descending priority order according
  53  * to the highest priority rule in each subtable, which allows lookup to skip
  54  * over subtables that can't possibly have a higher-priority match than
  55  * already found.
  56  *
  57  * One detail: a classifier can contain multiple rules that are identical other
  58  * than their priority.  When this happens, only the highest priority rule out
  59  * of a group of otherwise identical rules is stored directly in the "struct
  60  * cls_subtable", with the other almost-identical rules chained off a linked
  61  * list inside that highest-priority rule.
  62  *
  63  *
  64  * Partitioning
  65  * ============
  66  *
  67  * Suppose that a given classifier is being used to handle multiple stages in a
  68  * pipeline using "resubmit", with metadata (that is, the OpenFlow 1.1+ field
  69  * named "metadata") distinguishing between the different stages.  For example,
  70  * metadata value 1 might identify ingress rules, metadata value 2 might
  71  * identify ACLs, and metadata value 3 might identify egress rules.  Such a
  72  * classifier is essentially partitioned into multiple sub-classifiers on the
  73  * basis of the metadata value.
  74  *
  75  * The classifier has a special optimization to speed up matching in this
  76  * scenario:
  77  *
  78  *     - Each cls_subtable that matches on metadata gets a tag derived from the
  79  *       subtable's mask, so that it is likely that each subtable has a unique
  80  *       tag.  (Duplicate tags have a performance cost but do not affect
  81  *       correctness.)
  82  *
  83  *     - For each metadata value matched by any cls_rule, the classifier
  84  *       constructs a "struct cls_partition" indexed by the metadata value.
  85  *       The cls_partition has a 'tags' member whose value is the bitwise-OR of
  86  *       the tags of each cls_subtable that contains any rule that matches on
  87  *       the cls_partition's metadata value.  In other words, struct
  88  *       cls_partition associates metadata values with subtables that need to
  89  *       be checked with flows with that specific metadata value.
  90  *
  91  * Thus, a flow lookup can start by looking up the partition associated with
  92  * the flow's metadata, and then skip over any cls_subtable whose 'tag' does
  93  * not intersect the partition's 'tags'.  (The flow must also be looked up in
  94  * any cls_subtable that doesn't match on metadata.  We handle that by giving
  95  * any such cls_subtable TAG_ALL as its 'tags' so that it matches any tag.)
  96  *
  97  *
  98  * Thread-safety
  99  * =============
 100  *
 101  * The classifier may safely be accessed by many reader threads concurrently or
 102  * by a single writer. */
 103
 104 #include "flow.h"
 105 #include "hmap.h"
 106 #include "list.h"
 107 #include "match.h"
 108 #include "tag.h"
 109 #include "openflow/nicira-ext.h"
 110 #include "openflow/openflow.h"
 111 #include "ovs-thread.h"
 112 #include "util.h"
 113
 114 #ifdef __cplusplus
 115 extern "C" {
 116 #endif
 117
 118 /* Needed only for the lock annotation in struct classifier. */
 119 extern struct ovs_mutex ofproto_mutex;
 120
 121 /* A flow classifier. */
 122 struct classifier {
 123     int n_rules;                /* Total number of rules. */
 124     struct hmap subtables;      /* Contains "struct cls_subtable"s.  */
 125     struct list subtables_priority; /* Subtables in descending priority order.
 126                                      */
 127     struct hmap partitions;     /* Contains "struct cls_partition"s. */
 128     struct ovs_rwlock rwlock OVS_ACQ_AFTER(ofproto_mutex);
 129 };
 130
 131 /* A set of rules that all have the same fields wildcarded. */
 132 struct cls_subtable {
 133     struct hmap_node hmap_node; /* Within struct classifier 'subtables' hmap.
 134                                  */
 135     struct list list_node;      /* Within classifier 'subtables_priority' list.
 136                                  */
 137     struct hmap rules;          /* Contains "struct cls_rule"s. */
 138     struct minimask mask;       /* Wildcards for fields. */
 139     int n_rules;                /* Number of rules, including duplicates. */
 140     unsigned int max_priority;  /* Max priority of any rule in the subtable. */
 141     unsigned int max_count;     /* Count of max_priority rules. */
 142     tag_type tag;               /* Tag generated from mask for partitioning. */
 143 };
 144
 145 /* Returns true if 'table' is a "catch-all" subtable that will match every
 146  * packet (if there is no higher-priority match). */
 147 static inline bool
 148 cls_subtable_is_catchall(const struct cls_subtable *subtable)
 149 {
 150     return minimask_is_catchall(&subtable->mask);
 151 }
 152
 153 /* A rule in a "struct cls_subtable". */
 154 struct cls_rule {
 155     struct hmap_node hmap_node; /* Within struct cls_subtable 'rules'. */
 156     struct list list;           /* List of identical, lower-priority rules. */
 157     struct minimatch match;     /* Matching rule. */
 158     unsigned int priority;      /* Larger numbers are higher priorities. */
 159     struct cls_partition *partition;
 160 };
 161
 162 /* Associates a metadata value (that is, a value of the OpenFlow 1.1+ metadata
 163  * field) with tags for the "cls_subtable"s that contain rules that match that
 164  * metadata value.  */
 165 struct cls_partition {
 166     struct hmap_node hmap_node; /* In struct classifier's 'partitions' hmap. */
 167     ovs_be64 metadata;          /* metadata value for this partition. */
 168     tag_type tags;              /* OR of each flow's cls_subtable tag. */
 169     struct tag_tracker tracker; /* Tracks the bits in 'tags'. */
 170 };
 171
 172 void cls_rule_init(struct cls_rule *, const struct match *,
 173                    unsigned int priority);
 174 void cls_rule_init_from_minimatch(struct cls_rule *, const struct minimatch *,
 175                                   unsigned int priority);
 176 void cls_rule_clone(struct cls_rule *, const struct cls_rule *);
 177 void cls_rule_move(struct cls_rule *dst, struct cls_rule *src);
 178 void cls_rule_destroy(struct cls_rule *);
 179
 180 bool cls_rule_equal(const struct cls_rule *, const struct cls_rule *);
 181 uint32_t cls_rule_hash(const struct cls_rule *, uint32_t basis);
 182
 183 void cls_rule_format(const struct cls_rule *, struct ds *);
 184
 185 bool cls_rule_is_catchall(const struct cls_rule *);
 186
 187 bool cls_rule_is_loose_match(const struct cls_rule *rule,
 188                              const struct minimatch *criteria);
 189
 190 void classifier_init(struct classifier *cls);
 191 void classifier_destroy(struct classifier *);
 192 bool classifier_is_empty(const struct classifier *cls)
 193     OVS_REQ_RDLOCK(cls->rwlock);
 194 int classifier_count(const struct classifier *cls)
 195     OVS_REQ_RDLOCK(cls->rwlock);
 196 void classifier_insert(struct classifier *cls, struct cls_rule *)
 197     OVS_REQ_WRLOCK(cls->rwlock);
 198 struct cls_rule *classifier_replace(struct classifier *cls, struct cls_rule *)
 199     OVS_REQ_WRLOCK(cls->rwlock);
 200 void classifier_remove(struct classifier *cls, struct cls_rule *)
 201     OVS_REQ_WRLOCK(cls->rwlock);
 202 struct cls_rule *classifier_lookup(const struct classifier *cls,
 203                                    const struct flow *,
 204                                    struct flow_wildcards *)
 205     OVS_REQ_RDLOCK(cls->rwlock);
 206 bool classifier_rule_overlaps(const struct classifier *cls,
 207                               const struct cls_rule *)
 208     OVS_REQ_RDLOCK(cls->rwlock);
 209
 210 typedef void cls_cb_func(struct cls_rule *, void *aux);
 211
 212 struct cls_rule *classifier_find_rule_exactly(const struct classifier *cls,
 213                                               const struct cls_rule *)
 214     OVS_REQ_RDLOCK(cls->rwlock);
 215 struct cls_rule *classifier_find_match_exactly(const struct classifier *cls,
 216                                                const struct match *,
 217                                                unsigned int priority)
 218     OVS_REQ_RDLOCK(cls->rwlock);
 219 \f
 220 /* Iteration. */
 221
 222 struct cls_cursor {
 223     const struct classifier *cls;
 224     const struct cls_subtable *subtable;
 225     const struct cls_rule *target;
 226 };
 227
 228 void cls_cursor_init(struct cls_cursor *cursor, const struct classifier *cls,
 229                      const struct cls_rule *match) OVS_REQ_RDLOCK(cls->rwlock);
 230 struct cls_rule *cls_cursor_first(struct cls_cursor *cursor);
 231 struct cls_rule *cls_cursor_next(struct cls_cursor *, const struct cls_rule *);
 232
 233 #define CLS_CURSOR_FOR_EACH(RULE, MEMBER, CURSOR)                       \
 234     for (ASSIGN_CONTAINER(RULE, cls_cursor_first(CURSOR), MEMBER);      \
 235          RULE != OBJECT_CONTAINING(NULL, RULE, MEMBER);                 \
 236          ASSIGN_CONTAINER(RULE, cls_cursor_next(CURSOR, &(RULE)->MEMBER), \
 237                           MEMBER))
 238
 239 #define CLS_CURSOR_FOR_EACH_SAFE(RULE, NEXT, MEMBER, CURSOR)            \
 240     for (ASSIGN_CONTAINER(RULE, cls_cursor_first(CURSOR), MEMBER);      \
 241          (RULE != OBJECT_CONTAINING(NULL, RULE, MEMBER)                 \
 242           ? ASSIGN_CONTAINER(NEXT, cls_cursor_next(CURSOR, &(RULE)->MEMBER), \
 243                              MEMBER), 1                                 \
 244           : 0);                                                         \
 245          (RULE) = (NEXT))
 246
 247 #ifdef __cplusplus
 248 }
 249 #endif
 250
 251 #endif /* classifier.h */