X-Git-Url: https://pintos-os.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=lib%2Fnx-match.h;h=c7ee0f8d22430a239c6c0e1f4c56d1c5bc120db2;hb=3e3252fa1d7e057463ddbd66dab84f0d02ef0f1d;hp=5365ccafa2332ceac9228b4ead0d0882bc521568;hpb=43edca5717cf389eb87850abbf30efc738049921;p=openvswitch diff --git a/lib/nx-match.h b/lib/nx-match.h index 5365ccaf..c7ee0f8d 100644 --- a/lib/nx-match.h +++ b/lib/nx-match.h @@ -1,5 +1,5 @@ /* - * Copyright (c) 2010 Nicira Networks. + * Copyright (c) 2010, 2011 Nicira Networks. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. @@ -35,12 +35,16 @@ struct nx_action_reg_move; */ int nx_pull_match(struct ofpbuf *, unsigned int match_len, uint16_t priority, - struct cls_rule *); -int nx_put_match(struct ofpbuf *, const struct cls_rule *); + struct cls_rule *, ovs_be64 *cookie, ovs_be64 *cookie_mask); +int nx_put_match(struct ofpbuf *, const struct cls_rule *, + ovs_be64 cookie, ovs_be64 cookie_mask); char *nx_match_to_string(const uint8_t *, unsigned int match_len); int nx_match_from_string(const char *, struct ofpbuf *); +uint64_t nxm_read_field_bits(ovs_be32 header, ovs_be16 ofs_nbits, + const struct flow *); + void nxm_parse_reg_move(struct nx_action_reg_move *, const char *); void nxm_parse_reg_load(struct nx_action_reg_load *, const char *); @@ -49,7 +53,9 @@ void nxm_format_reg_load(const struct nx_action_reg_load *, struct ds *); int nxm_check_reg_move(const struct nx_action_reg_move *, const struct flow *); int nxm_check_reg_load(const struct nx_action_reg_load *, const struct flow *); -int nxm_dst_check(ovs_be32 dst, ovs_be16 ofs_nbits, size_t min_n_bits, +int nxm_src_check(ovs_be32 src, unsigned int ofs, unsigned int n_bits, + const struct flow *); +int nxm_dst_check(ovs_be32 dst, unsigned int ofs, unsigned int n_bits, const struct flow *); void nxm_execute_reg_move(const struct nx_action_reg_move *, struct flow *); @@ -85,8 +91,8 @@ nxm_decode_n_bits(ovs_be16 ofs_nbits) return (ntohs(ofs_nbits) & 0x3f) + 1; } -/* Upper bound on the length of an nx_match. The longest nx_match (assuming - * we implement 4 registers) would be: +/* Upper bound on the length of an nx_match. The longest nx_match (an + * IPV6 neighbor discovery message using 5 registers) would be: * * header value mask total * ------ ----- ---- ----- @@ -96,9 +102,13 @@ nxm_decode_n_bits(ovs_be16 ofs_nbits) * NXM_OF_ETH_TYPE 4 2 -- 6 * NXM_OF_VLAN_TCI 4 2 2 8 * NXM_OF_IP_TOS 4 1 -- 5 + * NXM_NX_IP_ECN 4 1 -- 5 + * NXM_OF_IP_TTL 4 1 -- 5 + * NXM_NX_IP_FRAG 4 1 1 8 * NXM_OF_IP_PROTO 4 2 -- 6 * NXM_OF_IPV6_SRC_W 4 16 16 36 * NXM_OF_IPV6_DST_W 4 16 16 36 + * NXM_OF_IPV6_LABEL 4 4 -- 8 * NXM_OF_ICMP_TYPE 4 1 -- 5 * NXM_OF_ICMP_CODE 4 1 -- 5 * NXM_NX_ND_TARGET 4 16 -- 20 @@ -107,13 +117,14 @@ nxm_decode_n_bits(ovs_be16 ofs_nbits) * NXM_NX_REG_W(1) 4 4 4 12 * NXM_NX_REG_W(2) 4 4 4 12 * NXM_NX_REG_W(3) 4 4 4 12 + * NXM_NX_REG_W(4) 4 4 4 12 * NXM_NX_TUN_ID_W 4 8 8 20 * ------------------------------------------- - * total 237 + * total 275 * * So this value is conservative. */ -#define NXM_MAX_LEN 256 +#define NXM_MAX_LEN 384 /* This is my guess at the length of a "typical" nx_match, for use in * predicting space requirements. */