On Thu, Dec 15, 2011 at 01:57:46AM +0530, sachin sharma wrote: > In older version, openvswitch has two types of flow-tables: one for > exact matched Flow Entries and other for?wildcard?matched Flow > Entries. First one was hash table and the second one was linear > table. Now in current version, there is only one type of flow-table > implemented for both exact matched flow-entries and wild-carded Flow > Entries.? > > Can someone please explain how is this?implemented?in the programming > point of view. Small description would be appreciated or is there any > document which explains about this implementation. Is it also a hash > table? If it is a hash table how the hash-key is calculated for > wildcarded entries or exacted matched entries?
lib/classifier.h has this comment: /* Flow classifier. * * A classifier is a "struct classifier", * a hash map from a set of wildcards to a "struct cls_table", * a hash map from fixed field values to "struct cls_rule", * which can contain a list of otherwise identical rules * with lower priorities. */ http://networkheresy.wordpress.com/2011/06/25/the-rise-of-soft-switching-part-ii-soft-switching-is-awesome-tm/ has a more informal description of the classifier (scroll down to "Soft Packet Classification"). _______________________________________________ discuss mailing list [email protected] http://openvswitch.org/mailman/listinfo/discuss
