blob: c62899d041d8069d2b43e4a549306e7a1ff293e5 [file] [log] [blame]
Rich Lanea06d0c32013-03-25 08:52:03 -07001# Copyright 2013, Big Switch Networks, Inc.
2#
3# LoxiGen is licensed under the Eclipse Public License, version 1.0 (EPL), with
4# the following special exception:
5#
6# LOXI Exception
7#
8# As a special exception to the terms of the EPL, you may distribute libraries
9# generated by LoxiGen (LoxiGen Libraries) under the terms of your choice, provided
10# that copyright and licensing notices generated by LoxiGen are not altered or removed
11# from the LoxiGen Libraries and the notice provided below is (i) included in
12# the LoxiGen Libraries, if distributed in source code form and (ii) included in any
13# documentation for the LoxiGen Libraries, if distributed in binary form.
14#
15# Notice: "Copyright 2013, Big Switch Networks, Inc. This library was generated by the LoxiGen Compiler."
16#
17# You may not use this file except in compliance with the EPL or LOXI Exception. You may obtain
18# a copy of the EPL at:
19#
20# http://www.eclipse.org/legal/epl-v10.html
21#
22# Unless required by applicable law or agreed to in writing, software
23# distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
24# WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
25# EPL for the specific language governing permissions and limitations
26# under the EPL.
27
28# @brief Generate wire to generic match conversion functions
29#
30# @fixme This has lots of C specific code that should be moved into c_gen
31
32# of_match_to_wire_match(match, wire_match)
33# of_wire_match_to_match(wire_match, match)
34# Version is taken from the source in each case
35#
36# name
37# type
38# conditions
39# v3 ident
40# takes mask
41
42import sys
43import of_g
Rich Lanea06d0c32013-03-25 08:52:03 -070044import loxi_front_end.match as match
45import c_code_gen
46
47def match_c_top_matter(out, name):
48 """
49 Generate top matter for match C file
50
51 @param name The name of the output file
52 @param out The output file object
53 """
54 c_code_gen.common_top_matter(out, name)
55 out.write("#include \"loci_log.h\"\n")
56 out.write("#include <loci/loci.h>\n")
57
58def match_h_top_matter(out, name):
59 """
60 Generate top matter for the C file
61
62 @param name The name of the output file
63 @param ih_name The name of the internal header file
64 @param out The output file object
65 """
66 c_code_gen.common_top_matter(out, name)
67 out.write("""
68#include <loci/loci_base.h>
69""")
70
71def gen_declarations(out):
72 out.write("""
73/*
74 * Match serialize/deserialize declarations
75 * Wire match conversion function declarations
76 */
77extern int of_match_serialize(of_version_t version, of_match_t *match,
78 of_octets_t *octets);
79extern int of_match_deserialize(of_version_t version, of_match_t *match,
80 of_octets_t *octets);
81extern int of_match_v1_to_match(of_match_v1_t *src, of_match_t *dst);
82extern int of_match_v2_to_match(of_match_v2_t *src, of_match_t *dst);
83extern int of_match_v3_to_match(of_match_v3_t *src, of_match_t *dst);
84extern int of_match_to_wire_match_v1(of_match_t *src, of_match_v1_t *dst);
85extern int of_match_to_wire_match_v2(of_match_t *src, of_match_v2_t *dst);
86extern int of_match_to_wire_match_v3(of_match_t *src, of_match_v3_t *dst);
87""")
88
89def gen_v4_match_compat(out):
90 """
91 Code for coercing version 1.3 matches to 1.2 matches
92
93 @FIXME This is a stopgap and needs to get cleaned up.
94 """
95 out.write("""
96/**
97 * Definitions to coerce v4 match (version 1.3) to v3 matches
98 * (version 1.2).
99 * @FIXME This is a stopgap and needs to get cleaned up.
100 */
101#define of_match_v4_t of_match_v3_t
102#define of_match_v4_init of_match_v3_init
103#define of_match_v4_new of_match_v3_new
104#define of_match_v4_to_match of_match_v3_to_match
105#define of_match_to_wire_match_v4 of_match_to_wire_match_v3
106#define of_match_v4_delete of_match_v3_delete
107""")
108
109def gen_match_macros(out):
110 out.write("""
111
112/**
113 * Definitions for wildcard macros for OF_VERSION_1_0
114 */
115
116""")
117 for key in match.of_v1_keys:
118 entry = match.of_match_members[key]
119 if "v1_wc_shift" in entry:
120 if key in ["ipv4_src", "ipv4_dst"]:
121 out.write("""
122#define OF_MATCH_V1_WC_%(ku)s_SHIFT %(val)d
123#define OF_MATCH_V1_WC_%(ku)s_MASK (0x3f << %(val)d)
124#define OF_MATCH_V1_WC_%(ku)s_CLEAR(wc) ((wc) &= ~(0x3f << %(val)d))
125#define OF_MATCH_V1_WC_%(ku)s_SET(wc, value) do { \\
126 OF_MATCH_V1_WC_%(ku)s_CLEAR(wc); \\
127 ((wc) |= (((value) & 0x3f) << %(val)d)); \\
128 } while (0)
129#define OF_MATCH_V1_WC_%(ku)s_TEST(wc) ((wc) & (0x3f << %(val)d))
130#define OF_MATCH_V1_WC_%(ku)s_GET(wc) (((wc) >> %(val)d) & 0x3f)
131""" % dict(ku=key.upper(), val=entry["v1_wc_shift"]))
132 else:
133 out.write("""
134#define OF_MATCH_V1_WC_%(ku)s_SHIFT %(val)d
135#define OF_MATCH_V1_WC_%(ku)s_MASK (1 << %(val)d)
136#define OF_MATCH_V1_WC_%(ku)s_SET(wc) ((wc) |= (1 << %(val)d))
137#define OF_MATCH_V1_WC_%(ku)s_CLEAR(wc) ((wc) &= ~(1 << %(val)d))
138#define OF_MATCH_V1_WC_%(ku)s_TEST(wc) ((wc) & (1 << %(val)d))
139""" % dict(ku=key.upper(), val=entry["v1_wc_shift"]))
140
141 out.write("""
142
143/**
144 * Definitions for wildcard macros for OF_VERSION_1_1
145 */
146""")
147
148 for key in sorted(match.of_v2_keys):
149 entry = match.of_match_members[key]
150 if "v2_wc_shift" in entry:
151 out.write("""
152#define OF_MATCH_V2_WC_%(ku)s_SHIFT %(val)d
153#define OF_MATCH_V2_WC_%(ku)s_MASK (1 << %(val)d)
154#define OF_MATCH_V2_WC_%(ku)s_SET(wc) ((wc) |= (1 << %(val)d))
155#define OF_MATCH_V2_WC_%(ku)s_CLEAR(wc) ((wc) &= ~(1 << %(val)d))
156#define OF_MATCH_V2_WC_%(ku)s_TEST(wc) ((wc) & (1 << %(val)d))
157""" % dict(ku=key.upper(), val=entry["v2_wc_shift"]))
158
159
160def gen_match_struct(out=sys.stdout):
161 out.write("/* Unified, flat OpenFlow match structure based on OF 1.2 */\n")
162 out.write("typedef struct of_match_fields_s {\n")
163 out.write(" /* Version 1.2 is used for field names */\n")
164 for name in match.match_keys_sorted:
165 entry = match.of_match_members[name]
166 out.write(" %-20s %s;\n" % (entry["m_type"], entry["name"]))
167 out.write("""
168} of_match_fields_t;
169
170/**
171 * @brief The LOCI match structure.
172 */
173
174typedef struct of_match_s {
175 of_version_t version;
176 of_match_fields_t fields;
177 of_match_fields_t masks;
178} of_match_t;
179
180/**
Dan Talaycofb50d382013-08-05 16:00:17 -0700181 * Mask the values in the match structure according to its fields
182 */
183static inline void of_match_values_mask(of_match_t *match)
184{
185 int idx;
186
187 for (idx = 0; idx < sizeof(of_match_fields_t); idx++) {
188 ((uint8_t *)&match->fields)[idx] &= ((uint8_t *)&match->masks)[idx];
189 }
190}
191
192/**
Rich Lanea06d0c32013-03-25 08:52:03 -0700193 * IP Mask map. IP maks wildcards from OF 1.0 are interpretted as
194 * indices into the map below.
195 *
196 * of_ip_mask_map: Array mapping index to mask
197 * of_ip_mask_use_map: Boolean indication set when map is initialized
198 * of_ip_mask_map_init: Initialize to default values; set "use map".
199 */
200#define OF_IP_MASK_MAP_COUNT 64
201extern uint32_t of_ip_mask_map[OF_IP_MASK_MAP_COUNT];
202extern int of_ip_mask_map_init_done;
203
204#define OF_IP_MASK_INIT_CHECK \
205 if (!of_ip_mask_map_init_done) of_ip_mask_map_init()
206
207/**
208 * Initialize map
209 */
210extern void of_ip_mask_map_init(void);
211
212extern int of_ip_mask_map_set(int index, uint32_t mask);
213extern int of_ip_mask_map_get(int index, uint32_t *mask);
214
215/**
216 * @brief Map from mask to index
217 */
218
219extern int of_ip_mask_to_index(uint32_t mask);
220
221/**
222 * @brief Map from index to mask
223 */
224
225extern uint32_t of_ip_index_to_mask(int index);
226
227/**
228 * The signalling of an untagged packet varies by OF version.
229 * Use this macro to set the field value.
230 */
231#define OF_MATCH_UNTAGGED_VLAN_ID(version) \\
232 ((version) == OF_VERSION_1_0 ? 0xffff : \\
233 ((version) == OF_VERSION_1_1 ? 0xffff : 0))
234
235/**
236 * Version 1.1 had the notion of "any" vlan but must be set
237 */
238#define OF_MATCH_VLAN_TAG_PRESENT_ANY_ID(version) \\
239 ((version) == OF_VERSION_1_0 ? 0 /* @fixme */ : \\
240 ((version) == OF_VERSION_1_1 ? 0xfffe : 0x1000))
241""")
242
243def gen_oxm_defines(out):
244 """
245 Generate verbatim definitions for OXM
246 """
247 out.write("""
248
249/* These are from the OpenFlow 1.2 header file */
250
251/* OXM index values for bitmaps and parsing */
252enum of_oxm_index_e {
253 OF_OXM_INDEX_IN_PORT = 0, /* Switch input port. */
254 OF_OXM_INDEX_IN_PHY_PORT = 1, /* Switch physical input port. */
255 OF_OXM_INDEX_METADATA = 2, /* Metadata passed between tables. */
256 OF_OXM_INDEX_ETH_DST = 3, /* Ethernet destination address. */
257 OF_OXM_INDEX_ETH_SRC = 4, /* Ethernet source address. */
258 OF_OXM_INDEX_ETH_TYPE = 5, /* Ethernet frame type. */
259 OF_OXM_INDEX_VLAN_VID = 6, /* VLAN id. */
260 OF_OXM_INDEX_VLAN_PCP = 7, /* VLAN priority. */
261 OF_OXM_INDEX_IP_DSCP = 8, /* IP DSCP (6 bits in ToS field). */
262 OF_OXM_INDEX_IP_ECN = 9, /* IP ECN (2 bits in ToS field). */
263 OF_OXM_INDEX_IP_PROTO = 10, /* IP protocol. */
264 OF_OXM_INDEX_IPV4_SRC = 11, /* IPv4 source address. */
265 OF_OXM_INDEX_IPV4_DST = 12, /* IPv4 destination address. */
266 OF_OXM_INDEX_TCP_SRC = 13, /* TCP source port. */
267 OF_OXM_INDEX_TCP_DST = 14, /* TCP destination port. */
268 OF_OXM_INDEX_UDP_SRC = 15, /* UDP source port. */
269 OF_OXM_INDEX_UDP_DST = 16, /* UDP destination port. */
270 OF_OXM_INDEX_SCTP_SRC = 17, /* SCTP source port. */
271 OF_OXM_INDEX_SCTP_DST = 18, /* SCTP destination port. */
272 OF_OXM_INDEX_ICMPV4_TYPE = 19, /* ICMP type. */
273 OF_OXM_INDEX_ICMPV4_CODE = 20, /* ICMP code. */
274 OF_OXM_INDEX_ARP_OP = 21, /* ARP opcode. */
275 OF_OXM_INDEX_ARP_SPA = 22, /* ARP source IPv4 address. */
276 OF_OXM_INDEX_ARP_TPA = 23, /* ARP target IPv4 address. */
277 OF_OXM_INDEX_ARP_SHA = 24, /* ARP source hardware address. */
278 OF_OXM_INDEX_ARP_THA = 25, /* ARP target hardware address. */
279 OF_OXM_INDEX_IPV6_SRC = 26, /* IPv6 source address. */
280 OF_OXM_INDEX_IPV6_DST = 27, /* IPv6 destination address. */
281 OF_OXM_INDEX_IPV6_FLABEL = 28, /* IPv6 Flow Label */
282 OF_OXM_INDEX_ICMPV6_TYPE = 29, /* ICMPv6 type. */
283 OF_OXM_INDEX_ICMPV6_CODE = 30, /* ICMPv6 code. */
284 OF_OXM_INDEX_IPV6_ND_TARGET = 31, /* Target address for ND. */
285 OF_OXM_INDEX_IPV6_ND_SLL = 32, /* Source link-layer for ND. */
286 OF_OXM_INDEX_IPV6_ND_TLL = 33, /* Target link-layer for ND. */
287 OF_OXM_INDEX_MPLS_LABEL = 34, /* MPLS label. */
288 OF_OXM_INDEX_MPLS_TC = 35, /* MPLS TC. */
289};
290
291#define OF_OXM_BIT(index) (((uint64_t) 1) << (index))
292
293/*
294 * The generic match structure uses the OXM bit indices for it's
295 * bitmasks for active and masked values
296 */
297""")
298 for key, entry in match.of_match_members.items():
299 out.write("""
300/* Mask/value check/set macros for %(key)s */
301
302/**
303 * Set the mask for an exact match of %(key)s
304 */
305#define OF_MATCH_MASK_%(ku)s_EXACT_SET(_match) \\
306 MEMSET(&(_match)->masks.%(key)s, 0xff, \\
307 sizeof(((_match)->masks).%(key)s))
308
309/**
310 * Clear the mask for %(key)s making that field inactive for the match
311 */
312#define OF_MATCH_MASK_%(ku)s_CLEAR(_match) \\
313 MEMSET(&(_match)->masks.%(key)s, 0, \\
314 sizeof(((_match)->masks).%(key)s))
315
316/**
317 * Test whether the match is exact for %(key)s
318 */
319#define OF_MATCH_MASK_%(ku)s_EXACT_TEST(_match) \\
320 OF_VARIABLE_IS_ALL_ONES(&(((_match)->masks).%(key)s))
321
322/**
323 * Test whether key %(key)s is being checked in the match
324 */
325#define OF_MATCH_MASK_%(ku)s_ACTIVE_TEST(_match) \\
326 OF_VARIABLE_IS_NON_ZERO(&(((_match)->masks).%(key)s))
327
328""" % dict(key=key, bit=match.oxm_index(key), ku=key.upper()))
329
330def gen_incompat_members(out=sys.stdout):
331 """
332 Generate a macro that lists all the unified fields which are
333 incompatible with v1 matches
334 """
335 out.write("""
336/* Identify bits in unified match that are incompatible with V1, V2 matches */
337#define OF_MATCH_V1_INCOMPAT ( (uint64_t)0 """)
338 for key in match.of_match_members:
339 if key in match.of_v1_keys:
340 continue
341 out.write("\\\n | ((uint64_t)1 << %s)" % match.oxm_index(key))
342 out.write(")\n\n")
343
344 out.write("#define OF_MATCH_V2_INCOMPAT ( (uint64_t)0 ")
345 for key in match.of_match_members:
346 if key in match.of_v2_keys:
347 continue
348 out.write("\\\n | ((uint64_t)1 << %s)" % match.oxm_index(key))
349 out.write(""")
350
351/* Indexed by version number */
Rich Laneb157b0f2013-03-27 13:55:28 -0700352extern const uint64_t of_match_incompat[4];
Rich Lanea06d0c32013-03-25 08:52:03 -0700353""")
354
355
356# # FIXME: Make these version specific
357# def name_to_index(a, name, key="name"):
358# """
359# Given an array, a, with each entry a dict, and a name,
360# find the entry with key matching name and return the index
361# """
362# count = 0
363# for e in a:
364# if e[key] == name:
365# return count
366# count += 1
367# return -1
368
369def gen_wc_convert_literal(out):
370 """
371 A bunch of literal C code that's associated with match conversions
372 @param out The output file handle
373 """
374 out.write("""
375
376/* Some internal macros and utility functions */
377
378/* For counting bits in a uint32 */
379#define _VAL_AND_5s(v) ((v) & 0x55555555)
380#define _VAL_EVERY_OTHER(v) (_VAL_AND_5s(v) + _VAL_AND_5s(v >> 1))
381#define _VAL_AND_3s(v) ((v) & 0x33333333)
382#define _VAL_PAIRS(v) (_VAL_AND_3s(v) + _VAL_AND_3s(v >> 2))
383#define _VAL_QUADS(v) (((val) + ((val) >> 4)) & 0x0F0F0F0F)
384#define _VAL_BYTES(v) ((val) + ((val) >> 8))
385
386/**
387 * Counts the number of bits set in an integer
388 */
389static inline int
390_COUNT_BITS(unsigned int val)
391{
392 val = _VAL_EVERY_OTHER(val);
393 val = _VAL_PAIRS(val);
394 val = _VAL_QUADS(val);
395 val = _VAL_BYTES(val);
396
397 return (val & 0XFF) + ((val >> 16) & 0xFF);
398}
399
400/* Indexed by version number */
Rich Laneb157b0f2013-03-27 13:55:28 -0700401const uint64_t of_match_incompat[4] = {
Rich Lanea06d0c32013-03-25 08:52:03 -0700402 -1,
403 OF_MATCH_V1_INCOMPAT,
404 OF_MATCH_V2_INCOMPAT,
405 0
406};
407
408""")
409
410
411def gen_unified_match_to_v1(out):
412 """
413 Generate C code to convert a unified match structure to a V1 match struct
414 @param out The output file handle
415 """
416
417 out.write("""
418/**
419 * Check if match is compatible with OF 1.0
420 * @param match The match being checked
421 */
422static inline int
423of_match_v1_compat_check(of_match_t *match)
424{
425""")
426 for key in match.of_match_members:
427 if key in match.of_v1_keys:
428 continue
429 out.write("""
430 if (OF_MATCH_MASK_%(ku)s_ACTIVE_TEST(match)) {
431 return 0;
432 }
433""" % dict(ku=key.upper()))
434
435 out.write("""
436 return 1;
437}
438""")
439
440 out.write("""
441/**
442 * Convert a generic match object to an OF_VERSION_1_0 object
443 * @param src Pointer to the generic match object source
444 * @param dst Pointer to the OF 1.0 wire structure
445 *
446 * The wire structure is initialized by this function if it doesn't
447 * not have the proper object ID.
448 */
449
450int
451of_match_to_wire_match_v1(of_match_t *src, of_match_v1_t *dst)
452{
453 of_wc_bmap_t wildcards = 0;
454 int ip_mask_index;
455
456 if ((src == NULL) || (dst == NULL)) {
457 return OF_ERROR_PARAM;
458 }
459 if (!of_match_v1_compat_check(src)) {
460 return OF_ERROR_COMPAT;
461 }
462 if (dst->object_id != OF_MATCH_V1) {
463 of_match_v1_init(dst, OF_VERSION_1_0, 0, 0);
464 }
465""")
466 for key in sorted(match.of_v1_keys):
467 if key in ["ipv4_src", "ipv4_dst"]: # Special cases for masks here
468 out.write("""
469 if (OF_MATCH_MASK_%(ku)s_ACTIVE_TEST(src)) {
470 ip_mask_index = of_ip_mask_to_index(src->masks.%(key)s);
471 of_match_v1_%(key)s_set(dst, src->fields.%(key)s);
472 } else { /* Wildcarded, look for 0 mask */
473 ip_mask_index = of_ip_mask_to_index(0);
474 }
475 OF_MATCH_V1_WC_%(ku)s_SET(wildcards, ip_mask_index);
476""" % dict(key=key, ku=key.upper()))
477 else:
478 out.write("""
479 if (OF_MATCH_MASK_%(ku)s_ACTIVE_TEST(src)) {
480 of_match_v1_%(key)s_set(dst, src->fields.%(key)s);
481 } else {
482 OF_MATCH_V1_WC_%(ku)s_SET(wildcards);
483 }
484""" % dict(key=key, ku=key.upper()))
485
486 out.write("""
487 of_match_v1_wildcards_set(dst, wildcards);
488
489 return OF_ERROR_NONE;
490}
491""")
492
493def all_ones_mask(d_type):
494 if d_type == "of_mac_addr_t":
495 return "of_mac_addr_all_ones"
496 else:
497 return "((%s) -1)" % d_type
498
499def gen_unified_match_to_v2(out):
500 """
501 Generate C code to convert a unified match structure to a V2 match struct
502 @param out The output file handle
503 """
504
505 out.write("""
506/**
507 * Check if match is compatible with OF 1.0
508 * @param match The match being checked
509 */
510static inline int
511of_match_v2_compat_check(of_match_t *match)
512{
513""")
514 for key in match.of_match_members:
515 if key in match.of_v2_keys:
516 continue
517 out.write("""
518 if (OF_MATCH_MASK_%(ku)s_ACTIVE_TEST(match)) {
519 return 0;
520 }
521""" % dict(ku=key.upper()))
522
523 out.write("""
524 return 1;
525}
526""")
527
528 out.write("""
529/**
530 * Convert a generic match object to an OF_VERSION_1_1 object
531 * @param src Pointer to the generic match object source
532 * @param dst Pointer to the OF 1.1 wire structure
533 *
534 * The wire structure is initialized by this function.
535 */
536
537int
538of_match_to_wire_match_v2(of_match_t *src, of_match_v2_t *dst)
539{
540 of_wc_bmap_t wildcards = 0;
541
542 if ((src == NULL) || (dst == NULL)) {
543 return OF_ERROR_PARAM;
544 }
545 if (!of_match_v2_compat_check(src)) {
546 return OF_ERROR_COMPAT;
547 }
548 if (dst->object_id != OF_MATCH_V2) {
549 of_match_v2_init(dst, OF_VERSION_1_1, 0, 0);
550 }
551""")
552 for key in match.of_v2_keys:
553 if key in match.of_v2_full_mask:
554 ones_mask = all_ones_mask(match.of_match_members[key]["m_type"])
555 out.write("""
556 if (OF_MATCH_MASK_%(ku)s_ACTIVE_TEST(src)) {
557 if (!OF_MATCH_MASK_%(ku)s_EXACT_TEST(src)) {
558 of_match_v2_%(key)s_mask_set(dst,
559 src->masks.%(key)s);
560 } else { /* Exact match; use all ones mask */
561 of_match_v2_%(key)s_mask_set(dst,
562 %(ones_mask)s);
563 }
564 of_match_v2_%(key)s_set(dst, src->fields.%(key)s);
565 }
566
567""" % dict(key=key, ku=key.upper(), ones_mask=ones_mask))
568 else:
569 out.write("""
570 if (!OF_MATCH_MASK_%(ku)s_EXACT_TEST(src)) {
571 return OF_ERROR_COMPAT;
572 }
573 if (OF_MATCH_MASK_%(ku)s_ACTIVE_TEST(src)) {
574 of_match_v2_%(key)s_set(dst, src->fields.%(key)s);
575 } else {
576 OF_MATCH_V2_WC_%(ku)s_SET(wildcards);
577 }
578""" % dict(key=key, ku=key.upper(),
579 wc_bit="OF_MATCH_WC_V2_%s" % key.upper()))
580
581 out.write("""
582 of_match_v2_wildcards_set(dst, wildcards);
583
584 return OF_ERROR_NONE;
585}
586""")
587
588def gen_unified_match_to_v3(out):
589 """
590 Generate C code to convert a unified match structure to a V3 match
591
592 This is much easier as the unified struct is based on V3
593 @param out The output file handle
594 """
595 out.write("""
596static int
597populate_oxm_list(of_match_t *src, of_list_oxm_t *oxm_list)
598{
599 of_oxm_t oxm_entry;
600
601 /* For each active member, add an OXM entry to the list */
602""")
603 # @fixme Would like to generate the list in some reasonable order
604 for key, entry in match.of_match_members.items():
605 out.write("""\
606 if (OF_MATCH_MASK_%(ku)s_ACTIVE_TEST(src)) {
607 if (!OF_MATCH_MASK_%(ku)s_EXACT_TEST(src)) {
608 of_oxm_%(key)s_masked_t *elt;
609 elt = &oxm_entry.%(key)s_masked;
610
611 of_oxm_%(key)s_masked_init(elt,
Rich Lanecfd4ce02013-07-12 16:37:14 -0700612 oxm_list->version, -1, 1);
Rich Lanea06d0c32013-03-25 08:52:03 -0700613 of_list_oxm_append_bind(oxm_list, &oxm_entry);
Andreas Wundsam53256162013-05-02 14:05:53 -0700614 of_oxm_%(key)s_masked_value_set(elt,
Rich Lanea06d0c32013-03-25 08:52:03 -0700615 src->fields.%(key)s);
Andreas Wundsam53256162013-05-02 14:05:53 -0700616 of_oxm_%(key)s_masked_value_mask_set(elt,
Rich Lanea06d0c32013-03-25 08:52:03 -0700617 src->masks.%(key)s);
618 } else { /* Active, but not masked */
619 of_oxm_%(key)s_t *elt;
620 elt = &oxm_entry.%(key)s;
621 of_oxm_%(key)s_init(elt,
Rich Lanecfd4ce02013-07-12 16:37:14 -0700622 oxm_list->version, -1, 1);
Rich Lanea06d0c32013-03-25 08:52:03 -0700623 of_list_oxm_append_bind(oxm_list, &oxm_entry);
624 of_oxm_%(key)s_value_set(elt, src->fields.%(key)s);
625 }
626 }
627""" % dict(key=key, ku=key.upper()))
628 out.write("""
629 return OF_ERROR_NONE;
630}
631
632/**
633 * Convert a generic match object to an OF_VERSION_1_2 object
634 * @param src Pointer to the generic match object source
635 * @param dst Pointer to the OF 1.2 wire structure
636 *
637 * The wire structure is initialized by this function if the object
638 * id is not correct in the object
639 */
640
641int
642of_match_to_wire_match_v3(of_match_t *src, of_match_v3_t *dst)
643{
644 int rv = OF_ERROR_NONE;
645 of_list_oxm_t *oxm_list;
646
647 if ((src == NULL) || (dst == NULL)) {
648 return OF_ERROR_PARAM;
649 }
650 if (dst->object_id != OF_MATCH_V3) {
Rich Lanecfd4ce02013-07-12 16:37:14 -0700651 of_match_v3_init(dst, OF_VERSION_1_2, 0, 0);
Rich Lanea06d0c32013-03-25 08:52:03 -0700652 }
Rich Lanecfd4ce02013-07-12 16:37:14 -0700653 if ((oxm_list = of_list_oxm_new(dst->version)) == NULL) {
Rich Lanea06d0c32013-03-25 08:52:03 -0700654 return OF_ERROR_RESOURCE;
655 }
656
657 rv = populate_oxm_list(src, oxm_list);
658
659 if (rv == OF_ERROR_NONE) {
660 rv = of_match_v3_oxm_list_set(dst, oxm_list);
661 }
662
663 of_list_oxm_delete(oxm_list);
664
665 return rv;
666}
667""")
668
669def gen_v1_to_unified_match(out):
670 """
671 Generate the code that maps a v1 wire format match object
672 to a unified match object
673 """
674 # for each v1 member, if not in wildcards
675 # translate to unified. Treat nw_src/dst specially
676 out.write("""
677
678/**
679 * Convert an OF_VERSION_1_0 object to a generic match object
680 * @param src Pointer to the OF 1.0 wire structure source
681 * @param dst Pointer to the generic match object destination
682 *
683 * The wire structure is initialized by this function.
684 */
685
686int
687of_match_v1_to_match(of_match_v1_t *src, of_match_t *dst)
688{
689 of_wc_bmap_t wc;
690 int count;
691
692 MEMSET(dst, 0, sizeof(*dst));
693 dst->version = src->version;
694
695 of_match_v1_wildcards_get(src, &wc);
696""")
Rich Lanea06d0c32013-03-25 08:52:03 -0700697 for key in sorted(match.of_v1_keys):
698 if key in ["ipv4_src", "ipv4_dst"]: # Special cases for masks here
699 out.write("""
700 count = OF_MATCH_V1_WC_%(ku)s_GET(wc);
701 dst->masks.%(key)s = of_ip_index_to_mask(count);
Rich Lanea06d0c32013-03-25 08:52:03 -0700702 of_match_v1_%(key)s_get(src, &dst->fields.%(key)s);
Dan Talaycofb50d382013-08-05 16:00:17 -0700703 /* Clear the bits not indicated by mask; IP addrs are special for 1.0 */
704 dst->fields.%(key)s &= dst->masks.%(key)s;
Rich Lanea06d0c32013-03-25 08:52:03 -0700705""" % dict(ku=key.upper(), key=key))
706 else:
707 out.write("""
708 if (!(OF_MATCH_V1_WC_%(ku)s_TEST(wc))) {
709 of_match_v1_%(key)s_get(src, &dst->fields.%(key)s);
710 OF_MATCH_MASK_%(ku)s_EXACT_SET(dst);
711 }
712""" % dict(ku=key.upper(), key=key))
713
714 out.write("""
715 return OF_ERROR_NONE;
716}
717""")
718
719def gen_v2_to_unified_match(out):
720 """
721 Generate the code that maps a v2 wire format match object
722 to a unified match object
723 """
724 out.write("""
725int
726of_match_v2_to_match(of_match_v2_t *src, of_match_t *dst)
727{
728 of_wc_bmap_t wc;
729
730 MEMSET(dst, 0, sizeof(*dst));
731 dst->version = src->version;
732
733 of_match_v2_wildcards_get(src, &wc);
734""")
735 for key in match.of_v2_keys:
736 if key in match.of_v2_full_mask:
737 out.write("""
738 of_match_v2_%(key)s_mask_get(src, &dst->masks.%(key)s);
739 if (OF_VARIABLE_IS_NON_ZERO(&dst->masks.%(key)s)) { /* Matching something */
740 of_match_v2_%(key)s_get(src, &dst->fields.%(key)s);
741 }
742""" % dict(ku=key.upper(), key=key))
743 else:
744 out.write("""
745 if (!(OF_MATCH_V2_WC_%(ku)s_TEST(wc))) {
746 of_match_v2_%(key)s_get(src, &dst->fields.%(key)s);
747 OF_MATCH_MASK_%(ku)s_EXACT_SET(dst);
748 }
749""" % dict(ku=key.upper(), key=key))
750
751 out.write("""
Dan Talaycofb50d382013-08-05 16:00:17 -0700752 /* Clear values outside of masks */
753 of_match_values_mask(dst);
754
Rich Lanea06d0c32013-03-25 08:52:03 -0700755 return OF_ERROR_NONE;
756}
757""")
758
759
760def gen_v3_to_unified_match(out):
761 """
762 Generate the code that maps a v3 wire format match object
763 to a unified match object
764 """
765 # Iterate thru the OXM list members
766 out.write("""
767int
768of_match_v3_to_match(of_match_v3_t *src, of_match_t *dst)
769{
770 int rv;
771 of_list_oxm_t oxm_list;
772 of_oxm_t oxm_entry;
773""")
774# for key in match.of_match_members:
775# out.write(" of_oxm_%s_t *%s;\n" % (key, key))
776# out.write(" of_oxm_%s_masked_t *%s_masked;\n" % (key, key))
777
778 out.write("""
779 MEMSET(dst, 0, sizeof(*dst));
780 dst->version = src->version;
781
782 of_match_v3_oxm_list_bind(src, &oxm_list);
783 rv = of_list_oxm_first(&oxm_list, &oxm_entry);
784
785 while (rv == OF_ERROR_NONE) {
786 switch (oxm_entry.header.object_id) { /* What kind of entry is this */
787""")
788 for key in match.of_match_members:
789 out.write("""
790 case OF_OXM_%(ku)s_MASKED:
791 of_oxm_%(key)s_masked_value_mask_get(
792 &oxm_entry.%(key)s_masked,
793 &dst->masks.%(key)s);
794 of_oxm_%(key)s_masked_value_get(
795 &oxm_entry.%(key)s,
796 &dst->fields.%(key)s);
797 break;
798 case OF_OXM_%(ku)s:
799 OF_MATCH_MASK_%(ku)s_EXACT_SET(dst);
800 of_oxm_%(key)s_value_get(
801 &oxm_entry.%(key)s,
802 &dst->fields.%(key)s);
803 break;
804""" % (dict(ku=key.upper(), key=key)))
805
806 out.write("""
807 default:
808 /* @fixme Add debug statement */
809 return OF_ERROR_PARSE;
810 } /* end switch */
811 rv = of_list_oxm_next(&oxm_list, &oxm_entry);
812 } /* end OXM iteration */
813
Dan Talaycofb50d382013-08-05 16:00:17 -0700814 /* Clear values outside of masks */
815 of_match_values_mask(dst);
816
Rich Lanea06d0c32013-03-25 08:52:03 -0700817 return OF_ERROR_NONE;
818}
819""")
820
821def gen_serialize(out):
822 out.write("""
823/**
824 * Serialize a match structure according to the version passed
825 * @param version The version to use for serialization protocol
826 * @param match Pointer to the structure to serialize
827 * @param octets Pointer to an octets object to fill out
828 *
829 * A buffer is allocated using normal internal ALLOC/FREE semantics
830 * and pointed to by the octets object. The length of the resulting
831 * serialization is in octets->bytes.
832 *
833 * For 1.2 matches, returns the padded serialized structure
834 *
835 * Note that FREE must be called on octets->data when processing of
836 * the object is complete.
837 */
838
839int
840of_match_serialize(of_version_t version, of_match_t *match, of_octets_t *octets)
841{
842 int rv;
843
844 switch (version) {
845""")
846 for version in of_g.of_version_range:
847 out.write("""
848 case %(ver_name)s:
849 {
850 of_match_v%(version)s_t *wire_match;
851 wire_match = of_match_v%(version)s_new(version);
852 if (wire_match == NULL) {
853 return OF_ERROR_RESOURCE;
854 }
855 if ((rv = of_match_to_wire_match_v%(version)s(match, wire_match)) < 0) {
856 of_match_v%(version)s_delete(wire_match);
857 return rv;
858 }
859 octets->bytes = OF_MATCH_BYTES(wire_match->length);
860 of_object_wire_buffer_steal((of_object_t *)wire_match,
861 &octets->data);
862 of_match_v%(version)s_delete(wire_match);
863 }
864 break;
865""" % dict(version=version, ver_name=of_g.of_version_wire2name[version]))
866 out.write("""
867 default:
868 return OF_ERROR_COMPAT;
869 }
870
871 return OF_ERROR_NONE;
872}
873""")
874
875
876def gen_deserialize(out):
877 out.write("""
878/**
879 * Deserialize a match structure according to the version passed
880 * @param version The version to use for deserialization protocol
881 * @param match Pointer to the structure to fill out
882 * @param octets Pointer to an octets object holding serial buffer
883 *
884 * Normally the octets object will point to a part of a wire buffer.
885 */
886
887int
888of_match_deserialize(of_version_t version, of_match_t *match,
889 of_octets_t *octets)
890{
891 if (octets->bytes == 0) { /* No match specified means all wildcards */
892 MEMSET(match, 0, sizeof(*match));
893 match->version = version;
894
895 return OF_ERROR_NONE;
896 }
897
898 switch (version) {
899""")
900 for version in of_g.of_version_range:
901 out.write("""
902 case %(ver_name)s:
903 { /* FIXME: check init bytes */
904 uint8_t *tmp;
905 of_match_v%(version)d_t wire_match;
906 of_match_v%(version)d_init(&wire_match,
907 %(ver_name)s, -1, 1);
Andreas Wundsam53256162013-05-02 14:05:53 -0700908 of_object_buffer_bind((of_object_t *)&wire_match,
Rich Lanea06d0c32013-03-25 08:52:03 -0700909 octets->data, octets->bytes, NULL);
910 OF_TRY(of_match_v%(version)d_to_match(&wire_match, match));
911
912 /* Free the wire buffer control block without freeing
913 * octets->bytes. */
914 of_wire_buffer_steal(wire_match.wire_object.wbuf, &tmp);
915 }
916 break;
917""" % dict(version=version, ver_name=of_g.of_version_wire2name[version]))
918
919 out.write("""
920 default:
921 return OF_ERROR_COMPAT;
922 }
923
924 return OF_ERROR_NONE;
925}
926""")
927
928def gen_match_comp(out=sys.stdout):
929 """
930 Generate match comparison functions
931 """
932 out.write("""
933/**
934 * Determine "more specific" relationship between mac addrs
935 * @return true if v1 is equal to or more specific than v2
936 *
937 * @todo Could be optimized
938 *
939 * Check: Every bit in v2 is set in v1; v1 may have add'l bits set.
940 * That is, return false if there is a bit set in v2 and not in v1.
941 */
942
943static inline int
944of_more_specific_ipv6(of_ipv6_t *v1, of_ipv6_t *v2) {
945 int idx;
946
947 for (idx = 0; idx < OF_IPV6_BYTES; idx++) {
948 /* If there's a bit set in v2 that is clear in v1, return false */
949 if (~v1->addr[idx] & v2->addr[idx]) {
950 return 0;
951 }
952 }
953
954 return 1;
955}
956
957/**
958 * Boolean test if two values agree when restricted to a mask
959 */
960
961static inline int
962of_restricted_match_ipv6(of_ipv6_t *v1, of_ipv6_t *v2, of_ipv6_t *mask) {
963 int idx;
964
965 for (idx = 0; idx < OF_IPV6_BYTES; idx++) {
Andreas Wundsam53256162013-05-02 14:05:53 -0700966 if ((v1->addr[idx] & mask->addr[idx]) !=
Rich Lanea06d0c32013-03-25 08:52:03 -0700967 (v2->addr[idx] & mask->addr[idx])) {
968 return 0;
969 }
970 }
971
972 return 1;
973}
974
975/**
976 * Boolean test if two values "overlap" (agree on common masks)
977 */
978
979static inline int
980of_overlap_ipv6(of_ipv6_t *v1, of_ipv6_t *v2,
981 of_ipv6_t *m1, of_ipv6_t *m2) {
982 int idx;
983
984 for (idx = 0; idx < OF_IPV6_BYTES; idx++) {
Andreas Wundsam53256162013-05-02 14:05:53 -0700985 if (((v1->addr[idx] & m1->addr[idx]) & m2->addr[idx]) !=
Rich Lanea06d0c32013-03-25 08:52:03 -0700986 ((v2->addr[idx] & m1->addr[idx]) & m2->addr[idx])) {
987 return 0;
988 }
989 }
990
991 return 1;
992}
993
994#define OF_MORE_SPECIFIC_IPV6(v1, v2) of_more_specific_ipv6((v1), (v2))
995
996#define OF_RESTRICTED_MATCH_IPV6(v1, v2, mask) \\
997 of_restricted_match_ipv6((v1), (v2), (mask))
998
999#define OF_OVERLAP_IPV6(v1, v2, m1, m2) of_overlap_ipv6((v1), (v2), (m1), (m2))
1000
1001/**
1002 * Determine "more specific" relationship between mac addrs
1003 * @return true if v1 is equal to or more specific than v2
1004 *
1005 * @todo Could be optimized
1006 *
1007 * Check: Every bit in v2 is set in v1; v1 may have add'l bits set.
1008 * That is, return false if there is a bit set in v2 and not in v1.
1009 */
1010static inline int
1011of_more_specific_mac_addr(of_mac_addr_t *v1, of_mac_addr_t *v2) {
1012 int idx;
1013
1014 for (idx = 0; idx < OF_MAC_ADDR_BYTES; idx++) {
1015 /* If there's a bit set in v2 that is clear in v1, return false */
1016 if (~v1->addr[idx] & v2->addr[idx]) {
1017 return 0;
1018 }
1019 }
1020
1021 return 1;
1022}
1023
1024/**
1025 * Boolean test if two values agree when restricted to a mask
1026 */
1027static inline int
Andreas Wundsam53256162013-05-02 14:05:53 -07001028of_restricted_match_mac_addr(of_mac_addr_t *v1, of_mac_addr_t *v2,
Rich Lanea06d0c32013-03-25 08:52:03 -07001029 of_mac_addr_t *mask) {
1030 int idx;
1031
1032 for (idx = 0; idx < OF_MAC_ADDR_BYTES; idx++) {
Andreas Wundsam53256162013-05-02 14:05:53 -07001033 if ((v1->addr[idx] & mask->addr[idx]) !=
Rich Lanea06d0c32013-03-25 08:52:03 -07001034 (v2->addr[idx] & mask->addr[idx])) {
1035 return 0;
1036 }
1037 }
1038
1039 return 1;
1040}
1041
1042/**
1043 * Boolean test if two values "overlap" (agree on common masks)
1044 */
1045
1046static inline int
1047of_overlap_mac_addr(of_mac_addr_t *v1, of_mac_addr_t *v2,
1048 of_mac_addr_t *m1, of_mac_addr_t *m2) {
1049 int idx;
1050
1051 for (idx = 0; idx < OF_MAC_ADDR_BYTES; idx++) {
Andreas Wundsam53256162013-05-02 14:05:53 -07001052 if (((v1->addr[idx] & m1->addr[idx]) & m2->addr[idx]) !=
Rich Lanea06d0c32013-03-25 08:52:03 -07001053 ((v2->addr[idx] & m1->addr[idx]) & m2->addr[idx])) {
1054 return 0;
1055 }
1056 }
1057
1058 return 1;
1059}
1060
1061#define OF_MORE_SPECIFIC_MAC_ADDR(v1, v2) of_more_specific_mac_addr((v1), (v2))
1062
1063#define OF_RESTRICTED_MATCH_MAC_ADDR(v1, v2, mask) \\
1064 of_restricted_match_mac_addr((v1), (v2), (mask))
1065
1066#define OF_OVERLAP_MAC_ADDR(v1, v2, m1, m2) \\
1067 of_overlap_mac_addr((v1), (v2), (m1), (m2))
1068
Rich Lane3b2fd832013-09-24 13:44:08 -07001069#define OF_MORE_SPECIFIC_BITMAP_128(v1, v2) \\
1070 (OF_MORE_SPECIFIC_INT((v1)->lo, (v2)->lo) && OF_MORE_SPECIFIC_INT((v1)->hi, (v2)->hi))
1071
1072#define OF_RESTRICTED_MATCH_BITMAP_128(v1, v2, mask) \\
1073 (OF_RESTRICTED_MATCH_INT((v1)->lo, (v2)->lo, (mask)->lo) && OF_RESTRICTED_MATCH_INT((v1)->hi, (v2)->hi, (mask)->hi))
1074
1075#define OF_OVERLAP_BITMAP_128(v1, v2, m1, m2) \\
1076 (OF_OVERLAP_INT((v1)->lo, (v2)->lo, (m1)->lo, (m2)->lo) && OF_OVERLAP_INT((v1)->hi, (v2)->hi, (m1)->hi, (m2)->hi))
1077
Rich Lanea06d0c32013-03-25 08:52:03 -07001078/**
1079 * More-specific-than macro for integer types; see above
1080 * @return true if v1 is equal to or more specific than v2
1081 *
1082 * If there is a bit that is set in v2 and not in v1, return false.
1083 */
1084#define OF_MORE_SPECIFIC_INT(v1, v2) (!(~(v1) & (v2)))
1085
1086/**
1087 * Boolean test if two values agree when restricted to a mask
1088 */
1089#define OF_RESTRICTED_MATCH_INT(v1, v2, mask) \\
1090 (((v1) & (mask)) == ((v2) & (mask)))
1091
1092
1093#define OF_OVERLAP_INT(v1, v2, m1, m2) \\
1094 ((((v1) & (m1)) & (m2)) == (((v2) & (m1)) & (m2)))
1095""")
1096
1097 out.write("""
1098/**
1099 * Compare two match structures for exact equality
1100 *
1101 * We just do memcmp assuming structs were memset to 0 on init
1102 */
1103static inline int
1104of_match_eq(of_match_t *match1, of_match_t *match2)
1105{
1106 return (MEMCMP(match1, match2, sizeof(of_match_t)) == 0);
1107}
1108
1109/**
1110 * Is the entry match more specific than (or equal to) the query match?
1111 * @param entry Match expected to be more specific (subset of query)
1112 * @param query Match expected to be less specific (superset of entry)
1113 * @returns Boolean, see below
1114 *
1115 * The assumption is that a query is being done for a non-strict
1116 * match against an entry in a table. The result is true if the
1117 * entry match indicates a more specific (but compatible) flow space
1118 * specification than that in the query match. This means that the
1119 * values agree between the two where they overlap, and that each mask
1120 * for the entry is more specific than that of the query.
1121 *
1122 * The query has the less specific mask (fewer mask bits) so it is
1123 * used for the mask when checking values.
1124 */
1125
1126static inline int
1127of_match_more_specific(of_match_t *entry, of_match_t *query)
1128{
1129 of_match_fields_t *q_m, *e_m; /* Short hand for masks, fields */
1130 of_match_fields_t *q_f, *e_f;
1131
1132 q_m = &query->masks;
1133 e_m = &entry->masks;
1134 q_f = &query->fields;
1135 e_f = &entry->fields;
1136""")
1137 for key, entry in match.of_match_members.items():
1138 q_m = "&q_m->%s" % key
1139 e_m = "&e_m->%s" % key
1140 q_f = "&q_f->%s" % key
1141 e_f = "&e_f->%s" % key
1142 if entry["m_type"] == "of_ipv6_t":
1143 comp = "OF_MORE_SPECIFIC_IPV6"
1144 match_type = "OF_RESTRICTED_MATCH_IPV6"
1145 elif entry["m_type"] == "of_mac_addr_t":
1146 comp = "OF_MORE_SPECIFIC_MAC_ADDR"
1147 match_type = "OF_RESTRICTED_MATCH_MAC_ADDR"
Rich Lane3b2fd832013-09-24 13:44:08 -07001148 elif entry["m_type"] == "of_bitmap_128_t":
1149 comp = "OF_MORE_SPECIFIC_BITMAP_128"
1150 match_type = "OF_RESTRICTED_MATCH_BITMAP_128"
Rich Lanea06d0c32013-03-25 08:52:03 -07001151 else: # Integer
1152 comp = "OF_MORE_SPECIFIC_INT"
1153 match_type = "OF_RESTRICTED_MATCH_INT"
1154 q_m = "q_m->%s" % key
1155 e_m = "e_m->%s" % key
1156 q_f = "q_f->%s" % key
1157 e_f = "e_f->%s" % key
1158 out.write("""
1159 /* Mask and values for %(key)s */
1160 if (!%(comp)s(%(e_m)s, %(q_m)s)) {
1161 return 0;
1162 }
1163 if (!%(match_type)s(%(e_f)s, %(q_f)s,
1164 %(q_m)s)) {
1165 return 0;
1166 }
Andreas Wundsam53256162013-05-02 14:05:53 -07001167""" % dict(match_type=match_type, comp=comp, q_f=q_f, e_f=e_f,
Rich Lanea06d0c32013-03-25 08:52:03 -07001168 q_m=q_m, e_m=e_m, key=key))
1169
1170 out.write("""
1171 return 1;
1172}
1173""")
1174
1175 out.write("""
1176
1177/**
1178 * Do two entries overlap?
1179 * @param match1 One match struct
1180 * @param match2 Another match struct
1181 * @returns Boolean: true if there is a packet that would match both
1182 *
1183 */
1184
1185static inline int
1186of_match_overlap(of_match_t *match1, of_match_t *match2)
1187{
1188 of_match_fields_t *m1, *m2; /* Short hand for masks, fields */
1189 of_match_fields_t *f1, *f2;
1190
1191 m1 = &match1->masks;
1192 m2 = &match2->masks;
1193 f1 = &match1->fields;
1194 f2 = &match2->fields;
1195""")
1196 for key, entry in match.of_match_members.items():
1197 m1 = "&m1->%s" % key
1198 m2 = "&m2->%s" % key
1199 f1 = "&f1->%s" % key
1200 f2 = "&f2->%s" % key
1201 if entry["m_type"] == "of_ipv6_t":
1202 check = "OF_OVERLAP_IPV6"
1203 elif entry["m_type"] == "of_mac_addr_t":
1204 check = "OF_OVERLAP_MAC_ADDR"
Rich Lane3b2fd832013-09-24 13:44:08 -07001205 elif entry["m_type"] == "of_bitmap_128_t":
1206 check = "OF_OVERLAP_BITMAP_128"
Rich Lanea06d0c32013-03-25 08:52:03 -07001207 else: # Integer
1208 check = "OF_OVERLAP_INT"
1209 m1 = "m1->%s" % key
1210 m2 = "m2->%s" % key
1211 f1 = "f1->%s" % key
1212 f2 = "f2->%s" % key
1213 out.write("""
1214 /* Check overlap for %(key)s */
Andreas Wundsam53256162013-05-02 14:05:53 -07001215 if (!%(check)s(%(f1)s, %(f2)s,
Rich Lanea06d0c32013-03-25 08:52:03 -07001216 %(m2)s, %(m1)s)) {
1217 return 0; /* This field differentiates; all done */
1218 }
1219""" % dict(check=check, f1=f1, f2=f2, m1=m1, m2=m2, key=key))
1220
1221 out.write("""
1222 return 1; /* No field differentiates matches */
1223}
1224""")
1225
1226def gen_match_conversions(out=sys.stdout):
1227 match.match_sanity_check()
1228 gen_wc_convert_literal(out)
1229 out.write("""
1230/**
1231 * IP Mask map. IP maks wildcards from OF 1.0 are interpretted as
1232 * indices into the map below.
1233 */
1234
1235int of_ip_mask_map_init_done = 0;
1236uint32_t of_ip_mask_map[OF_IP_MASK_MAP_COUNT];
1237void
1238of_ip_mask_map_init(void)
1239{
1240 int idx;
1241
1242 MEMSET(of_ip_mask_map, 0, sizeof(of_ip_mask_map));
1243 for (idx = 0; idx < 32; idx++) {
1244 of_ip_mask_map[idx] = ~((1U << idx) - 1);
1245 }
1246
1247 of_ip_mask_map_init_done = 1;
1248}
1249
1250/**
1251 * @brief Set non-default IP mask for given index
1252 */
1253int
1254of_ip_mask_map_set(int index, uint32_t mask)
1255{
1256 OF_IP_MASK_INIT_CHECK;
1257
1258 if ((index < 0) || (index >= OF_IP_MASK_MAP_COUNT)) {
1259 return OF_ERROR_RANGE;
1260 }
1261 of_ip_mask_map[index] = mask;
1262
1263 return OF_ERROR_NONE;
1264}
1265
1266/**
1267 * @brief Get a non-default IP mask for given index
1268 */
1269int
1270of_ip_mask_map_get(int index, uint32_t *mask)
1271{
1272 OF_IP_MASK_INIT_CHECK;
1273
1274 if ((mask == NULL) || (index < 0) || (index >= OF_IP_MASK_MAP_COUNT)) {
1275 return OF_ERROR_RANGE;
1276 }
1277 *mask = of_ip_mask_map[index];
1278
1279 return OF_ERROR_NONE;
1280}
1281
1282/**
1283 * @brief Return the index (used as the WC field in 1.0 match) given the mask
1284 */
1285
1286int
1287of_ip_mask_to_index(uint32_t mask)
1288{
1289 int idx;
1290
1291 OF_IP_MASK_INIT_CHECK;
1292
1293 /* Handle most common cases directly */
1294 if ((mask == 0) && (of_ip_mask_map[63] == 0)) {
1295 return 63;
1296 }
1297 if ((mask == 0xffffffff) && (of_ip_mask_map[0] == 0xffffffff)) {
1298 return 0;
1299 }
1300
1301 for (idx = 0; idx < OF_IP_MASK_MAP_COUNT; idx++) {
1302 if (mask == of_ip_mask_map[idx]) {
1303 return idx;
1304 }
1305 }
1306
1307 LOCI_LOG_INFO("OF 1.0: Could not map IP addr mask 0x%x", mask);
1308 return 0x3f;
1309}
1310
1311/**
1312 * @brief Return the mask for the given index
1313 */
1314
1315uint32_t
1316of_ip_index_to_mask(int index)
1317{
1318 OF_IP_MASK_INIT_CHECK;
1319
1320 if (index >= OF_IP_MASK_MAP_COUNT) {
1321 LOCI_LOG_INFO("IP index to map: bad index %d", index);
1322 return 0;
1323 }
1324
1325 return of_ip_mask_map[index];
1326}
1327
1328""")
1329
1330 gen_unified_match_to_v1(out)
1331 gen_unified_match_to_v2(out)
1332 gen_unified_match_to_v3(out)
1333 gen_v1_to_unified_match(out)
1334 gen_v2_to_unified_match(out)
1335 gen_v3_to_unified_match(out)
1336 return