blob: 270a6bab687453fcf5b9ecfe71406d7fd1f95bcb [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. */
Rich Laned8d29c92013-09-24 13:46:42 -0700289
290 OF_OXM_INDEX_BSN_IN_PORTS_128 = 36,
Rich Lane61718362013-10-24 16:59:42 -0700291 OF_OXM_INDEX_BSN_LAG_ID = 37,
Rich Lanea06d0c32013-03-25 08:52:03 -0700292};
293
294#define OF_OXM_BIT(index) (((uint64_t) 1) << (index))
295
296/*
297 * The generic match structure uses the OXM bit indices for it's
298 * bitmasks for active and masked values
299 */
300""")
301 for key, entry in match.of_match_members.items():
302 out.write("""
303/* Mask/value check/set macros for %(key)s */
304
305/**
306 * Set the mask for an exact match of %(key)s
307 */
308#define OF_MATCH_MASK_%(ku)s_EXACT_SET(_match) \\
309 MEMSET(&(_match)->masks.%(key)s, 0xff, \\
310 sizeof(((_match)->masks).%(key)s))
311
312/**
313 * Clear the mask for %(key)s making that field inactive for the match
314 */
315#define OF_MATCH_MASK_%(ku)s_CLEAR(_match) \\
316 MEMSET(&(_match)->masks.%(key)s, 0, \\
317 sizeof(((_match)->masks).%(key)s))
318
319/**
320 * Test whether the match is exact for %(key)s
321 */
322#define OF_MATCH_MASK_%(ku)s_EXACT_TEST(_match) \\
323 OF_VARIABLE_IS_ALL_ONES(&(((_match)->masks).%(key)s))
324
325/**
326 * Test whether key %(key)s is being checked in the match
327 */
328#define OF_MATCH_MASK_%(ku)s_ACTIVE_TEST(_match) \\
329 OF_VARIABLE_IS_NON_ZERO(&(((_match)->masks).%(key)s))
330
331""" % dict(key=key, bit=match.oxm_index(key), ku=key.upper()))
332
333def gen_incompat_members(out=sys.stdout):
334 """
335 Generate a macro that lists all the unified fields which are
336 incompatible with v1 matches
337 """
338 out.write("""
339/* Identify bits in unified match that are incompatible with V1, V2 matches */
340#define OF_MATCH_V1_INCOMPAT ( (uint64_t)0 """)
341 for key in match.of_match_members:
342 if key in match.of_v1_keys:
343 continue
344 out.write("\\\n | ((uint64_t)1 << %s)" % match.oxm_index(key))
345 out.write(")\n\n")
346
347 out.write("#define OF_MATCH_V2_INCOMPAT ( (uint64_t)0 ")
348 for key in match.of_match_members:
349 if key in match.of_v2_keys:
350 continue
351 out.write("\\\n | ((uint64_t)1 << %s)" % match.oxm_index(key))
352 out.write(""")
353
354/* Indexed by version number */
Rich Laneb157b0f2013-03-27 13:55:28 -0700355extern const uint64_t of_match_incompat[4];
Rich Lanea06d0c32013-03-25 08:52:03 -0700356""")
357
358
359# # FIXME: Make these version specific
360# def name_to_index(a, name, key="name"):
361# """
362# Given an array, a, with each entry a dict, and a name,
363# find the entry with key matching name and return the index
364# """
365# count = 0
366# for e in a:
367# if e[key] == name:
368# return count
369# count += 1
370# return -1
371
372def gen_wc_convert_literal(out):
373 """
374 A bunch of literal C code that's associated with match conversions
375 @param out The output file handle
376 """
377 out.write("""
378
379/* Some internal macros and utility functions */
380
381/* For counting bits in a uint32 */
382#define _VAL_AND_5s(v) ((v) & 0x55555555)
383#define _VAL_EVERY_OTHER(v) (_VAL_AND_5s(v) + _VAL_AND_5s(v >> 1))
384#define _VAL_AND_3s(v) ((v) & 0x33333333)
385#define _VAL_PAIRS(v) (_VAL_AND_3s(v) + _VAL_AND_3s(v >> 2))
386#define _VAL_QUADS(v) (((val) + ((val) >> 4)) & 0x0F0F0F0F)
387#define _VAL_BYTES(v) ((val) + ((val) >> 8))
388
389/**
390 * Counts the number of bits set in an integer
391 */
392static inline int
393_COUNT_BITS(unsigned int val)
394{
395 val = _VAL_EVERY_OTHER(val);
396 val = _VAL_PAIRS(val);
397 val = _VAL_QUADS(val);
398 val = _VAL_BYTES(val);
399
400 return (val & 0XFF) + ((val >> 16) & 0xFF);
401}
402
403/* Indexed by version number */
Rich Laneb157b0f2013-03-27 13:55:28 -0700404const uint64_t of_match_incompat[4] = {
Rich Lanea06d0c32013-03-25 08:52:03 -0700405 -1,
406 OF_MATCH_V1_INCOMPAT,
407 OF_MATCH_V2_INCOMPAT,
408 0
409};
410
411""")
412
413
414def gen_unified_match_to_v1(out):
415 """
416 Generate C code to convert a unified match structure to a V1 match struct
417 @param out The output file handle
418 """
419
420 out.write("""
421/**
422 * Check if match is compatible with OF 1.0
423 * @param match The match being checked
424 */
425static inline int
426of_match_v1_compat_check(of_match_t *match)
427{
428""")
429 for key in match.of_match_members:
430 if key in match.of_v1_keys:
431 continue
432 out.write("""
433 if (OF_MATCH_MASK_%(ku)s_ACTIVE_TEST(match)) {
434 return 0;
435 }
436""" % dict(ku=key.upper()))
437
438 out.write("""
439 return 1;
440}
441""")
442
443 out.write("""
444/**
445 * Convert a generic match object to an OF_VERSION_1_0 object
446 * @param src Pointer to the generic match object source
447 * @param dst Pointer to the OF 1.0 wire structure
448 *
449 * The wire structure is initialized by this function if it doesn't
450 * not have the proper object ID.
451 */
452
453int
454of_match_to_wire_match_v1(of_match_t *src, of_match_v1_t *dst)
455{
456 of_wc_bmap_t wildcards = 0;
457 int ip_mask_index;
458
459 if ((src == NULL) || (dst == NULL)) {
460 return OF_ERROR_PARAM;
461 }
462 if (!of_match_v1_compat_check(src)) {
463 return OF_ERROR_COMPAT;
464 }
465 if (dst->object_id != OF_MATCH_V1) {
466 of_match_v1_init(dst, OF_VERSION_1_0, 0, 0);
467 }
468""")
469 for key in sorted(match.of_v1_keys):
470 if key in ["ipv4_src", "ipv4_dst"]: # Special cases for masks here
471 out.write("""
472 if (OF_MATCH_MASK_%(ku)s_ACTIVE_TEST(src)) {
473 ip_mask_index = of_ip_mask_to_index(src->masks.%(key)s);
474 of_match_v1_%(key)s_set(dst, src->fields.%(key)s);
475 } else { /* Wildcarded, look for 0 mask */
476 ip_mask_index = of_ip_mask_to_index(0);
477 }
478 OF_MATCH_V1_WC_%(ku)s_SET(wildcards, ip_mask_index);
479""" % dict(key=key, ku=key.upper()))
480 else:
481 out.write("""
482 if (OF_MATCH_MASK_%(ku)s_ACTIVE_TEST(src)) {
483 of_match_v1_%(key)s_set(dst, src->fields.%(key)s);
484 } else {
485 OF_MATCH_V1_WC_%(ku)s_SET(wildcards);
486 }
487""" % dict(key=key, ku=key.upper()))
488
489 out.write("""
490 of_match_v1_wildcards_set(dst, wildcards);
491
492 return OF_ERROR_NONE;
493}
494""")
495
496def all_ones_mask(d_type):
497 if d_type == "of_mac_addr_t":
498 return "of_mac_addr_all_ones"
499 else:
500 return "((%s) -1)" % d_type
501
502def gen_unified_match_to_v2(out):
503 """
504 Generate C code to convert a unified match structure to a V2 match struct
505 @param out The output file handle
506 """
507
508 out.write("""
509/**
510 * Check if match is compatible with OF 1.0
511 * @param match The match being checked
512 */
513static inline int
514of_match_v2_compat_check(of_match_t *match)
515{
516""")
517 for key in match.of_match_members:
518 if key in match.of_v2_keys:
519 continue
520 out.write("""
521 if (OF_MATCH_MASK_%(ku)s_ACTIVE_TEST(match)) {
522 return 0;
523 }
524""" % dict(ku=key.upper()))
525
526 out.write("""
527 return 1;
528}
529""")
530
531 out.write("""
532/**
533 * Convert a generic match object to an OF_VERSION_1_1 object
534 * @param src Pointer to the generic match object source
535 * @param dst Pointer to the OF 1.1 wire structure
536 *
537 * The wire structure is initialized by this function.
538 */
539
540int
541of_match_to_wire_match_v2(of_match_t *src, of_match_v2_t *dst)
542{
543 of_wc_bmap_t wildcards = 0;
544
545 if ((src == NULL) || (dst == NULL)) {
546 return OF_ERROR_PARAM;
547 }
548 if (!of_match_v2_compat_check(src)) {
549 return OF_ERROR_COMPAT;
550 }
551 if (dst->object_id != OF_MATCH_V2) {
552 of_match_v2_init(dst, OF_VERSION_1_1, 0, 0);
553 }
554""")
555 for key in match.of_v2_keys:
556 if key in match.of_v2_full_mask:
557 ones_mask = all_ones_mask(match.of_match_members[key]["m_type"])
558 out.write("""
559 if (OF_MATCH_MASK_%(ku)s_ACTIVE_TEST(src)) {
560 if (!OF_MATCH_MASK_%(ku)s_EXACT_TEST(src)) {
561 of_match_v2_%(key)s_mask_set(dst,
562 src->masks.%(key)s);
563 } else { /* Exact match; use all ones mask */
564 of_match_v2_%(key)s_mask_set(dst,
565 %(ones_mask)s);
566 }
567 of_match_v2_%(key)s_set(dst, src->fields.%(key)s);
568 }
569
570""" % dict(key=key, ku=key.upper(), ones_mask=ones_mask))
571 else:
572 out.write("""
573 if (!OF_MATCH_MASK_%(ku)s_EXACT_TEST(src)) {
574 return OF_ERROR_COMPAT;
575 }
576 if (OF_MATCH_MASK_%(ku)s_ACTIVE_TEST(src)) {
577 of_match_v2_%(key)s_set(dst, src->fields.%(key)s);
578 } else {
579 OF_MATCH_V2_WC_%(ku)s_SET(wildcards);
580 }
581""" % dict(key=key, ku=key.upper(),
582 wc_bit="OF_MATCH_WC_V2_%s" % key.upper()))
583
584 out.write("""
585 of_match_v2_wildcards_set(dst, wildcards);
586
587 return OF_ERROR_NONE;
588}
589""")
590
591def gen_unified_match_to_v3(out):
592 """
593 Generate C code to convert a unified match structure to a V3 match
594
595 This is much easier as the unified struct is based on V3
596 @param out The output file handle
597 """
598 out.write("""
599static int
600populate_oxm_list(of_match_t *src, of_list_oxm_t *oxm_list)
601{
602 of_oxm_t oxm_entry;
603
604 /* For each active member, add an OXM entry to the list */
605""")
Rich Lane4964d542013-10-14 18:13:47 -0700606 for key in match.match_keys_sorted:
607 entry = match.of_match_members[key]
Rich Lanea06d0c32013-03-25 08:52:03 -0700608 out.write("""\
609 if (OF_MATCH_MASK_%(ku)s_ACTIVE_TEST(src)) {
610 if (!OF_MATCH_MASK_%(ku)s_EXACT_TEST(src)) {
611 of_oxm_%(key)s_masked_t *elt;
612 elt = &oxm_entry.%(key)s_masked;
613
614 of_oxm_%(key)s_masked_init(elt,
Rich Lanecfd4ce02013-07-12 16:37:14 -0700615 oxm_list->version, -1, 1);
Rich Lanea06d0c32013-03-25 08:52:03 -0700616 of_list_oxm_append_bind(oxm_list, &oxm_entry);
Andreas Wundsam53256162013-05-02 14:05:53 -0700617 of_oxm_%(key)s_masked_value_set(elt,
Rich Lanea06d0c32013-03-25 08:52:03 -0700618 src->fields.%(key)s);
Andreas Wundsam53256162013-05-02 14:05:53 -0700619 of_oxm_%(key)s_masked_value_mask_set(elt,
Rich Lanea06d0c32013-03-25 08:52:03 -0700620 src->masks.%(key)s);
621 } else { /* Active, but not masked */
622 of_oxm_%(key)s_t *elt;
623 elt = &oxm_entry.%(key)s;
624 of_oxm_%(key)s_init(elt,
Rich Lanecfd4ce02013-07-12 16:37:14 -0700625 oxm_list->version, -1, 1);
Rich Lanea06d0c32013-03-25 08:52:03 -0700626 of_list_oxm_append_bind(oxm_list, &oxm_entry);
627 of_oxm_%(key)s_value_set(elt, src->fields.%(key)s);
628 }
629 }
630""" % dict(key=key, ku=key.upper()))
631 out.write("""
632 return OF_ERROR_NONE;
633}
634
635/**
636 * Convert a generic match object to an OF_VERSION_1_2 object
637 * @param src Pointer to the generic match object source
638 * @param dst Pointer to the OF 1.2 wire structure
639 *
640 * The wire structure is initialized by this function if the object
641 * id is not correct in the object
642 */
643
644int
645of_match_to_wire_match_v3(of_match_t *src, of_match_v3_t *dst)
646{
647 int rv = OF_ERROR_NONE;
648 of_list_oxm_t *oxm_list;
649
650 if ((src == NULL) || (dst == NULL)) {
651 return OF_ERROR_PARAM;
652 }
653 if (dst->object_id != OF_MATCH_V3) {
Rich Lanecfd4ce02013-07-12 16:37:14 -0700654 of_match_v3_init(dst, OF_VERSION_1_2, 0, 0);
Rich Lanea06d0c32013-03-25 08:52:03 -0700655 }
Rich Lanecfd4ce02013-07-12 16:37:14 -0700656 if ((oxm_list = of_list_oxm_new(dst->version)) == NULL) {
Rich Lanea06d0c32013-03-25 08:52:03 -0700657 return OF_ERROR_RESOURCE;
658 }
659
660 rv = populate_oxm_list(src, oxm_list);
661
662 if (rv == OF_ERROR_NONE) {
663 rv = of_match_v3_oxm_list_set(dst, oxm_list);
664 }
665
666 of_list_oxm_delete(oxm_list);
667
668 return rv;
669}
670""")
671
672def gen_v1_to_unified_match(out):
673 """
674 Generate the code that maps a v1 wire format match object
675 to a unified match object
676 """
677 # for each v1 member, if not in wildcards
678 # translate to unified. Treat nw_src/dst specially
679 out.write("""
680
681/**
682 * Convert an OF_VERSION_1_0 object to a generic match object
683 * @param src Pointer to the OF 1.0 wire structure source
684 * @param dst Pointer to the generic match object destination
685 *
686 * The wire structure is initialized by this function.
687 */
688
689int
690of_match_v1_to_match(of_match_v1_t *src, of_match_t *dst)
691{
692 of_wc_bmap_t wc;
693 int count;
694
695 MEMSET(dst, 0, sizeof(*dst));
696 dst->version = src->version;
697
698 of_match_v1_wildcards_get(src, &wc);
699""")
Rich Lanea06d0c32013-03-25 08:52:03 -0700700 for key in sorted(match.of_v1_keys):
701 if key in ["ipv4_src", "ipv4_dst"]: # Special cases for masks here
702 out.write("""
703 count = OF_MATCH_V1_WC_%(ku)s_GET(wc);
704 dst->masks.%(key)s = of_ip_index_to_mask(count);
Rich Lanea06d0c32013-03-25 08:52:03 -0700705 of_match_v1_%(key)s_get(src, &dst->fields.%(key)s);
Dan Talaycofb50d382013-08-05 16:00:17 -0700706 /* Clear the bits not indicated by mask; IP addrs are special for 1.0 */
707 dst->fields.%(key)s &= dst->masks.%(key)s;
Rich Lanea06d0c32013-03-25 08:52:03 -0700708""" % dict(ku=key.upper(), key=key))
709 else:
710 out.write("""
711 if (!(OF_MATCH_V1_WC_%(ku)s_TEST(wc))) {
712 of_match_v1_%(key)s_get(src, &dst->fields.%(key)s);
713 OF_MATCH_MASK_%(ku)s_EXACT_SET(dst);
714 }
715""" % dict(ku=key.upper(), key=key))
716
717 out.write("""
718 return OF_ERROR_NONE;
719}
720""")
721
722def gen_v2_to_unified_match(out):
723 """
724 Generate the code that maps a v2 wire format match object
725 to a unified match object
726 """
727 out.write("""
728int
729of_match_v2_to_match(of_match_v2_t *src, of_match_t *dst)
730{
731 of_wc_bmap_t wc;
732
733 MEMSET(dst, 0, sizeof(*dst));
734 dst->version = src->version;
735
736 of_match_v2_wildcards_get(src, &wc);
737""")
738 for key in match.of_v2_keys:
739 if key in match.of_v2_full_mask:
740 out.write("""
741 of_match_v2_%(key)s_mask_get(src, &dst->masks.%(key)s);
742 if (OF_VARIABLE_IS_NON_ZERO(&dst->masks.%(key)s)) { /* Matching something */
743 of_match_v2_%(key)s_get(src, &dst->fields.%(key)s);
744 }
745""" % dict(ku=key.upper(), key=key))
746 else:
747 out.write("""
748 if (!(OF_MATCH_V2_WC_%(ku)s_TEST(wc))) {
749 of_match_v2_%(key)s_get(src, &dst->fields.%(key)s);
750 OF_MATCH_MASK_%(ku)s_EXACT_SET(dst);
751 }
752""" % dict(ku=key.upper(), key=key))
753
754 out.write("""
Dan Talaycofb50d382013-08-05 16:00:17 -0700755 /* Clear values outside of masks */
756 of_match_values_mask(dst);
757
Rich Lanea06d0c32013-03-25 08:52:03 -0700758 return OF_ERROR_NONE;
759}
760""")
761
762
763def gen_v3_to_unified_match(out):
764 """
765 Generate the code that maps a v3 wire format match object
766 to a unified match object
767 """
768 # Iterate thru the OXM list members
769 out.write("""
770int
771of_match_v3_to_match(of_match_v3_t *src, of_match_t *dst)
772{
773 int rv;
774 of_list_oxm_t oxm_list;
775 of_oxm_t oxm_entry;
776""")
777# for key in match.of_match_members:
778# out.write(" of_oxm_%s_t *%s;\n" % (key, key))
779# out.write(" of_oxm_%s_masked_t *%s_masked;\n" % (key, key))
780
781 out.write("""
782 MEMSET(dst, 0, sizeof(*dst));
783 dst->version = src->version;
784
785 of_match_v3_oxm_list_bind(src, &oxm_list);
786 rv = of_list_oxm_first(&oxm_list, &oxm_entry);
787
788 while (rv == OF_ERROR_NONE) {
789 switch (oxm_entry.header.object_id) { /* What kind of entry is this */
790""")
791 for key in match.of_match_members:
792 out.write("""
793 case OF_OXM_%(ku)s_MASKED:
794 of_oxm_%(key)s_masked_value_mask_get(
795 &oxm_entry.%(key)s_masked,
796 &dst->masks.%(key)s);
797 of_oxm_%(key)s_masked_value_get(
798 &oxm_entry.%(key)s,
799 &dst->fields.%(key)s);
800 break;
801 case OF_OXM_%(ku)s:
802 OF_MATCH_MASK_%(ku)s_EXACT_SET(dst);
803 of_oxm_%(key)s_value_get(
804 &oxm_entry.%(key)s,
805 &dst->fields.%(key)s);
806 break;
807""" % (dict(ku=key.upper(), key=key)))
808
809 out.write("""
810 default:
811 /* @fixme Add debug statement */
812 return OF_ERROR_PARSE;
813 } /* end switch */
814 rv = of_list_oxm_next(&oxm_list, &oxm_entry);
815 } /* end OXM iteration */
816
Dan Talaycofb50d382013-08-05 16:00:17 -0700817 /* Clear values outside of masks */
818 of_match_values_mask(dst);
819
Rich Lanea06d0c32013-03-25 08:52:03 -0700820 return OF_ERROR_NONE;
821}
822""")
823
824def gen_serialize(out):
825 out.write("""
826/**
827 * Serialize a match structure according to the version passed
828 * @param version The version to use for serialization protocol
829 * @param match Pointer to the structure to serialize
830 * @param octets Pointer to an octets object to fill out
831 *
832 * A buffer is allocated using normal internal ALLOC/FREE semantics
833 * and pointed to by the octets object. The length of the resulting
834 * serialization is in octets->bytes.
835 *
836 * For 1.2 matches, returns the padded serialized structure
837 *
838 * Note that FREE must be called on octets->data when processing of
839 * the object is complete.
840 */
841
842int
843of_match_serialize(of_version_t version, of_match_t *match, of_octets_t *octets)
844{
845 int rv;
846
847 switch (version) {
848""")
849 for version in of_g.of_version_range:
850 out.write("""
851 case %(ver_name)s:
852 {
853 of_match_v%(version)s_t *wire_match;
854 wire_match = of_match_v%(version)s_new(version);
855 if (wire_match == NULL) {
856 return OF_ERROR_RESOURCE;
857 }
858 if ((rv = of_match_to_wire_match_v%(version)s(match, wire_match)) < 0) {
859 of_match_v%(version)s_delete(wire_match);
860 return rv;
861 }
862 octets->bytes = OF_MATCH_BYTES(wire_match->length);
863 of_object_wire_buffer_steal((of_object_t *)wire_match,
864 &octets->data);
865 of_match_v%(version)s_delete(wire_match);
866 }
867 break;
868""" % dict(version=version, ver_name=of_g.of_version_wire2name[version]))
869 out.write("""
870 default:
871 return OF_ERROR_COMPAT;
872 }
873
874 return OF_ERROR_NONE;
875}
876""")
877
878
879def gen_deserialize(out):
880 out.write("""
881/**
882 * Deserialize a match structure according to the version passed
883 * @param version The version to use for deserialization protocol
884 * @param match Pointer to the structure to fill out
885 * @param octets Pointer to an octets object holding serial buffer
886 *
887 * Normally the octets object will point to a part of a wire buffer.
888 */
889
890int
891of_match_deserialize(of_version_t version, of_match_t *match,
892 of_octets_t *octets)
893{
894 if (octets->bytes == 0) { /* No match specified means all wildcards */
895 MEMSET(match, 0, sizeof(*match));
896 match->version = version;
897
898 return OF_ERROR_NONE;
899 }
900
901 switch (version) {
902""")
903 for version in of_g.of_version_range:
904 out.write("""
905 case %(ver_name)s:
906 { /* FIXME: check init bytes */
907 uint8_t *tmp;
908 of_match_v%(version)d_t wire_match;
909 of_match_v%(version)d_init(&wire_match,
910 %(ver_name)s, -1, 1);
Andreas Wundsam53256162013-05-02 14:05:53 -0700911 of_object_buffer_bind((of_object_t *)&wire_match,
Rich Lanea06d0c32013-03-25 08:52:03 -0700912 octets->data, octets->bytes, NULL);
913 OF_TRY(of_match_v%(version)d_to_match(&wire_match, match));
914
915 /* Free the wire buffer control block without freeing
916 * octets->bytes. */
917 of_wire_buffer_steal(wire_match.wire_object.wbuf, &tmp);
918 }
919 break;
920""" % dict(version=version, ver_name=of_g.of_version_wire2name[version]))
921
922 out.write("""
923 default:
924 return OF_ERROR_COMPAT;
925 }
926
927 return OF_ERROR_NONE;
928}
929""")
930
931def gen_match_comp(out=sys.stdout):
932 """
933 Generate match comparison functions
934 """
935 out.write("""
936/**
937 * Determine "more specific" relationship between mac addrs
938 * @return true if v1 is equal to or more specific than v2
939 *
940 * @todo Could be optimized
941 *
942 * Check: Every bit in v2 is set in v1; v1 may have add'l bits set.
943 * That is, return false if there is a bit set in v2 and not in v1.
944 */
945
946static inline int
947of_more_specific_ipv6(of_ipv6_t *v1, of_ipv6_t *v2) {
948 int idx;
949
950 for (idx = 0; idx < OF_IPV6_BYTES; idx++) {
951 /* If there's a bit set in v2 that is clear in v1, return false */
952 if (~v1->addr[idx] & v2->addr[idx]) {
953 return 0;
954 }
955 }
956
957 return 1;
958}
959
960/**
961 * Boolean test if two values agree when restricted to a mask
962 */
963
964static inline int
965of_restricted_match_ipv6(of_ipv6_t *v1, of_ipv6_t *v2, of_ipv6_t *mask) {
966 int idx;
967
968 for (idx = 0; idx < OF_IPV6_BYTES; idx++) {
Andreas Wundsam53256162013-05-02 14:05:53 -0700969 if ((v1->addr[idx] & mask->addr[idx]) !=
Rich Lanea06d0c32013-03-25 08:52:03 -0700970 (v2->addr[idx] & mask->addr[idx])) {
971 return 0;
972 }
973 }
974
975 return 1;
976}
977
978/**
979 * Boolean test if two values "overlap" (agree on common masks)
980 */
981
982static inline int
983of_overlap_ipv6(of_ipv6_t *v1, of_ipv6_t *v2,
984 of_ipv6_t *m1, of_ipv6_t *m2) {
985 int idx;
986
987 for (idx = 0; idx < OF_IPV6_BYTES; idx++) {
Andreas Wundsam53256162013-05-02 14:05:53 -0700988 if (((v1->addr[idx] & m1->addr[idx]) & m2->addr[idx]) !=
Rich Lanea06d0c32013-03-25 08:52:03 -0700989 ((v2->addr[idx] & m1->addr[idx]) & m2->addr[idx])) {
990 return 0;
991 }
992 }
993
994 return 1;
995}
996
997#define OF_MORE_SPECIFIC_IPV6(v1, v2) of_more_specific_ipv6((v1), (v2))
998
999#define OF_RESTRICTED_MATCH_IPV6(v1, v2, mask) \\
1000 of_restricted_match_ipv6((v1), (v2), (mask))
1001
1002#define OF_OVERLAP_IPV6(v1, v2, m1, m2) of_overlap_ipv6((v1), (v2), (m1), (m2))
1003
1004/**
1005 * Determine "more specific" relationship between mac addrs
1006 * @return true if v1 is equal to or more specific than v2
1007 *
1008 * @todo Could be optimized
1009 *
1010 * Check: Every bit in v2 is set in v1; v1 may have add'l bits set.
1011 * That is, return false if there is a bit set in v2 and not in v1.
1012 */
1013static inline int
1014of_more_specific_mac_addr(of_mac_addr_t *v1, of_mac_addr_t *v2) {
1015 int idx;
1016
1017 for (idx = 0; idx < OF_MAC_ADDR_BYTES; idx++) {
1018 /* If there's a bit set in v2 that is clear in v1, return false */
1019 if (~v1->addr[idx] & v2->addr[idx]) {
1020 return 0;
1021 }
1022 }
1023
1024 return 1;
1025}
1026
1027/**
1028 * Boolean test if two values agree when restricted to a mask
1029 */
1030static inline int
Andreas Wundsam53256162013-05-02 14:05:53 -07001031of_restricted_match_mac_addr(of_mac_addr_t *v1, of_mac_addr_t *v2,
Rich Lanea06d0c32013-03-25 08:52:03 -07001032 of_mac_addr_t *mask) {
1033 int idx;
1034
1035 for (idx = 0; idx < OF_MAC_ADDR_BYTES; idx++) {
Andreas Wundsam53256162013-05-02 14:05:53 -07001036 if ((v1->addr[idx] & mask->addr[idx]) !=
Rich Lanea06d0c32013-03-25 08:52:03 -07001037 (v2->addr[idx] & mask->addr[idx])) {
1038 return 0;
1039 }
1040 }
1041
1042 return 1;
1043}
1044
1045/**
1046 * Boolean test if two values "overlap" (agree on common masks)
1047 */
1048
1049static inline int
1050of_overlap_mac_addr(of_mac_addr_t *v1, of_mac_addr_t *v2,
1051 of_mac_addr_t *m1, of_mac_addr_t *m2) {
1052 int idx;
1053
1054 for (idx = 0; idx < OF_MAC_ADDR_BYTES; idx++) {
Andreas Wundsam53256162013-05-02 14:05:53 -07001055 if (((v1->addr[idx] & m1->addr[idx]) & m2->addr[idx]) !=
Rich Lanea06d0c32013-03-25 08:52:03 -07001056 ((v2->addr[idx] & m1->addr[idx]) & m2->addr[idx])) {
1057 return 0;
1058 }
1059 }
1060
1061 return 1;
1062}
1063
1064#define OF_MORE_SPECIFIC_MAC_ADDR(v1, v2) of_more_specific_mac_addr((v1), (v2))
1065
1066#define OF_RESTRICTED_MATCH_MAC_ADDR(v1, v2, mask) \\
1067 of_restricted_match_mac_addr((v1), (v2), (mask))
1068
1069#define OF_OVERLAP_MAC_ADDR(v1, v2, m1, m2) \\
1070 of_overlap_mac_addr((v1), (v2), (m1), (m2))
1071
Rich Lane3b2fd832013-09-24 13:44:08 -07001072#define OF_MORE_SPECIFIC_BITMAP_128(v1, v2) \\
1073 (OF_MORE_SPECIFIC_INT((v1)->lo, (v2)->lo) && OF_MORE_SPECIFIC_INT((v1)->hi, (v2)->hi))
1074
1075#define OF_RESTRICTED_MATCH_BITMAP_128(v1, v2, mask) \\
1076 (OF_RESTRICTED_MATCH_INT((v1)->lo, (v2)->lo, (mask)->lo) && OF_RESTRICTED_MATCH_INT((v1)->hi, (v2)->hi, (mask)->hi))
1077
1078#define OF_OVERLAP_BITMAP_128(v1, v2, m1, m2) \\
1079 (OF_OVERLAP_INT((v1)->lo, (v2)->lo, (m1)->lo, (m2)->lo) && OF_OVERLAP_INT((v1)->hi, (v2)->hi, (m1)->hi, (m2)->hi))
1080
Rich Lanea06d0c32013-03-25 08:52:03 -07001081/**
1082 * More-specific-than macro for integer types; see above
1083 * @return true if v1 is equal to or more specific than v2
1084 *
1085 * If there is a bit that is set in v2 and not in v1, return false.
1086 */
1087#define OF_MORE_SPECIFIC_INT(v1, v2) (!(~(v1) & (v2)))
1088
1089/**
1090 * Boolean test if two values agree when restricted to a mask
1091 */
1092#define OF_RESTRICTED_MATCH_INT(v1, v2, mask) \\
1093 (((v1) & (mask)) == ((v2) & (mask)))
1094
1095
1096#define OF_OVERLAP_INT(v1, v2, m1, m2) \\
1097 ((((v1) & (m1)) & (m2)) == (((v2) & (m1)) & (m2)))
1098""")
1099
1100 out.write("""
1101/**
1102 * Compare two match structures for exact equality
1103 *
1104 * We just do memcmp assuming structs were memset to 0 on init
1105 */
1106static inline int
1107of_match_eq(of_match_t *match1, of_match_t *match2)
1108{
1109 return (MEMCMP(match1, match2, sizeof(of_match_t)) == 0);
1110}
1111
1112/**
1113 * Is the entry match more specific than (or equal to) the query match?
1114 * @param entry Match expected to be more specific (subset of query)
1115 * @param query Match expected to be less specific (superset of entry)
1116 * @returns Boolean, see below
1117 *
1118 * The assumption is that a query is being done for a non-strict
1119 * match against an entry in a table. The result is true if the
1120 * entry match indicates a more specific (but compatible) flow space
1121 * specification than that in the query match. This means that the
1122 * values agree between the two where they overlap, and that each mask
1123 * for the entry is more specific than that of the query.
1124 *
1125 * The query has the less specific mask (fewer mask bits) so it is
1126 * used for the mask when checking values.
1127 */
1128
1129static inline int
1130of_match_more_specific(of_match_t *entry, of_match_t *query)
1131{
1132 of_match_fields_t *q_m, *e_m; /* Short hand for masks, fields */
1133 of_match_fields_t *q_f, *e_f;
1134
1135 q_m = &query->masks;
1136 e_m = &entry->masks;
1137 q_f = &query->fields;
1138 e_f = &entry->fields;
1139""")
1140 for key, entry in match.of_match_members.items():
1141 q_m = "&q_m->%s" % key
1142 e_m = "&e_m->%s" % key
1143 q_f = "&q_f->%s" % key
1144 e_f = "&e_f->%s" % key
1145 if entry["m_type"] == "of_ipv6_t":
1146 comp = "OF_MORE_SPECIFIC_IPV6"
1147 match_type = "OF_RESTRICTED_MATCH_IPV6"
1148 elif entry["m_type"] == "of_mac_addr_t":
1149 comp = "OF_MORE_SPECIFIC_MAC_ADDR"
1150 match_type = "OF_RESTRICTED_MATCH_MAC_ADDR"
Rich Lane3b2fd832013-09-24 13:44:08 -07001151 elif entry["m_type"] == "of_bitmap_128_t":
1152 comp = "OF_MORE_SPECIFIC_BITMAP_128"
1153 match_type = "OF_RESTRICTED_MATCH_BITMAP_128"
Rich Lanea06d0c32013-03-25 08:52:03 -07001154 else: # Integer
1155 comp = "OF_MORE_SPECIFIC_INT"
1156 match_type = "OF_RESTRICTED_MATCH_INT"
1157 q_m = "q_m->%s" % key
1158 e_m = "e_m->%s" % key
1159 q_f = "q_f->%s" % key
1160 e_f = "e_f->%s" % key
1161 out.write("""
1162 /* Mask and values for %(key)s */
1163 if (!%(comp)s(%(e_m)s, %(q_m)s)) {
1164 return 0;
1165 }
1166 if (!%(match_type)s(%(e_f)s, %(q_f)s,
1167 %(q_m)s)) {
1168 return 0;
1169 }
Andreas Wundsam53256162013-05-02 14:05:53 -07001170""" % dict(match_type=match_type, comp=comp, q_f=q_f, e_f=e_f,
Rich Lanea06d0c32013-03-25 08:52:03 -07001171 q_m=q_m, e_m=e_m, key=key))
1172
1173 out.write("""
1174 return 1;
1175}
1176""")
1177
1178 out.write("""
1179
1180/**
1181 * Do two entries overlap?
1182 * @param match1 One match struct
1183 * @param match2 Another match struct
1184 * @returns Boolean: true if there is a packet that would match both
1185 *
1186 */
1187
1188static inline int
1189of_match_overlap(of_match_t *match1, of_match_t *match2)
1190{
1191 of_match_fields_t *m1, *m2; /* Short hand for masks, fields */
1192 of_match_fields_t *f1, *f2;
1193
1194 m1 = &match1->masks;
1195 m2 = &match2->masks;
1196 f1 = &match1->fields;
1197 f2 = &match2->fields;
1198""")
1199 for key, entry in match.of_match_members.items():
1200 m1 = "&m1->%s" % key
1201 m2 = "&m2->%s" % key
1202 f1 = "&f1->%s" % key
1203 f2 = "&f2->%s" % key
1204 if entry["m_type"] == "of_ipv6_t":
1205 check = "OF_OVERLAP_IPV6"
1206 elif entry["m_type"] == "of_mac_addr_t":
1207 check = "OF_OVERLAP_MAC_ADDR"
Rich Lane3b2fd832013-09-24 13:44:08 -07001208 elif entry["m_type"] == "of_bitmap_128_t":
1209 check = "OF_OVERLAP_BITMAP_128"
Rich Lanea06d0c32013-03-25 08:52:03 -07001210 else: # Integer
1211 check = "OF_OVERLAP_INT"
1212 m1 = "m1->%s" % key
1213 m2 = "m2->%s" % key
1214 f1 = "f1->%s" % key
1215 f2 = "f2->%s" % key
1216 out.write("""
1217 /* Check overlap for %(key)s */
Andreas Wundsam53256162013-05-02 14:05:53 -07001218 if (!%(check)s(%(f1)s, %(f2)s,
Rich Lanea06d0c32013-03-25 08:52:03 -07001219 %(m2)s, %(m1)s)) {
1220 return 0; /* This field differentiates; all done */
1221 }
1222""" % dict(check=check, f1=f1, f2=f2, m1=m1, m2=m2, key=key))
1223
1224 out.write("""
1225 return 1; /* No field differentiates matches */
1226}
1227""")
1228
1229def gen_match_conversions(out=sys.stdout):
1230 match.match_sanity_check()
1231 gen_wc_convert_literal(out)
1232 out.write("""
1233/**
1234 * IP Mask map. IP maks wildcards from OF 1.0 are interpretted as
1235 * indices into the map below.
1236 */
1237
1238int of_ip_mask_map_init_done = 0;
1239uint32_t of_ip_mask_map[OF_IP_MASK_MAP_COUNT];
1240void
1241of_ip_mask_map_init(void)
1242{
1243 int idx;
1244
1245 MEMSET(of_ip_mask_map, 0, sizeof(of_ip_mask_map));
1246 for (idx = 0; idx < 32; idx++) {
1247 of_ip_mask_map[idx] = ~((1U << idx) - 1);
1248 }
1249
1250 of_ip_mask_map_init_done = 1;
1251}
1252
1253/**
1254 * @brief Set non-default IP mask for given index
1255 */
1256int
1257of_ip_mask_map_set(int index, uint32_t mask)
1258{
1259 OF_IP_MASK_INIT_CHECK;
1260
1261 if ((index < 0) || (index >= OF_IP_MASK_MAP_COUNT)) {
1262 return OF_ERROR_RANGE;
1263 }
1264 of_ip_mask_map[index] = mask;
1265
1266 return OF_ERROR_NONE;
1267}
1268
1269/**
1270 * @brief Get a non-default IP mask for given index
1271 */
1272int
1273of_ip_mask_map_get(int index, uint32_t *mask)
1274{
1275 OF_IP_MASK_INIT_CHECK;
1276
1277 if ((mask == NULL) || (index < 0) || (index >= OF_IP_MASK_MAP_COUNT)) {
1278 return OF_ERROR_RANGE;
1279 }
1280 *mask = of_ip_mask_map[index];
1281
1282 return OF_ERROR_NONE;
1283}
1284
1285/**
1286 * @brief Return the index (used as the WC field in 1.0 match) given the mask
1287 */
1288
1289int
1290of_ip_mask_to_index(uint32_t mask)
1291{
1292 int idx;
1293
1294 OF_IP_MASK_INIT_CHECK;
1295
1296 /* Handle most common cases directly */
1297 if ((mask == 0) && (of_ip_mask_map[63] == 0)) {
1298 return 63;
1299 }
1300 if ((mask == 0xffffffff) && (of_ip_mask_map[0] == 0xffffffff)) {
1301 return 0;
1302 }
1303
1304 for (idx = 0; idx < OF_IP_MASK_MAP_COUNT; idx++) {
1305 if (mask == of_ip_mask_map[idx]) {
1306 return idx;
1307 }
1308 }
1309
1310 LOCI_LOG_INFO("OF 1.0: Could not map IP addr mask 0x%x", mask);
1311 return 0x3f;
1312}
1313
1314/**
1315 * @brief Return the mask for the given index
1316 */
1317
1318uint32_t
1319of_ip_index_to_mask(int index)
1320{
1321 OF_IP_MASK_INIT_CHECK;
1322
1323 if (index >= OF_IP_MASK_MAP_COUNT) {
1324 LOCI_LOG_INFO("IP index to map: bad index %d", index);
1325 return 0;
1326 }
1327
1328 return of_ip_mask_map[index];
1329}
1330
1331""")
1332
1333 gen_unified_match_to_v1(out)
1334 gen_unified_match_to_v2(out)
1335 gen_unified_match_to_v3(out)
1336 gen_v1_to_unified_match(out)
1337 gen_v2_to_unified_match(out)
1338 gen_v3_to_unified_match(out)
1339 return