2 * Copyright (c) 2015, Mellanox Technologies. All rights reserved.
4 * This software is available to you under a choice of one of two
5 * licenses. You may choose to be licensed under the terms of the GNU
6 * General Public License (GPL) Version 2, available from the file
7 * COPYING in the main directory of this source tree, or the
8 * OpenIB.org BSD license below:
10 * Redistribution and use in source and binary forms, with or
11 * without modification, are permitted provided that the following
14 * - Redistributions of source code must retain the above
15 * copyright notice, this list of conditions and the following
18 * - Redistributions in binary form must reproduce the above
19 * copyright notice, this list of conditions and the following
20 * disclaimer in the documentation and/or other materials
21 * provided with the distribution.
23 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
24 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
25 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
26 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
27 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
28 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
29 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
33 #ifndef _MLX5_FS_CORE_
34 #define _MLX5_FS_CORE_
36 #include <linux/mlx5/fs.h>
47 enum fs_flow_table_type {
52 FS_FTE_STATUS_EXISTING = 1UL << 0,
56 struct list_head list;
57 struct list_head children;
58 enum fs_node_type type;
59 struct fs_node *parent;
61 /* lock the node for writing and traversing */
64 void (*remove_func)(struct fs_node *);
67 struct mlx5_flow_rule {
69 struct mlx5_flow_destination dest_attr;
72 struct mlx5_flow_table {
76 enum fs_flow_table_type type;
81 u32 val[MLX5_ST_SZ_DW(fte_match_param)];
91 unsigned int start_level;
95 struct mlx5_flow_namespace {
96 /* parent == NULL => root ns */
100 struct mlx5_flow_group_mask {
101 u8 match_criteria_enable;
102 u32 match_criteria[MLX5_ST_SZ_DW(fte_match_param)];
105 #define fs_get_obj(v, _node) {v = container_of((_node), typeof(*v), node); }
107 #define fs_list_for_each_entry(pos, root) \
108 list_for_each_entry(pos, root, node.list)
110 #define fs_for_each_ns_or_ft_reverse(pos, prio) \
111 list_for_each_entry_reverse(pos, &(prio)->node.children, list)
113 #define fs_for_each_ns_or_ft(pos, prio) \
114 list_for_each_entry(pos, (&(prio)->node.children), list)
116 #define fs_for_each_prio(pos, ns) \
117 fs_list_for_each_entry(pos, &(ns)->node.children)
119 #define fs_for_each_fg(pos, ft) \
120 fs_list_for_each_entry(pos, &(ft)->node.children)
122 #define fs_for_each_fte(pos, fg) \
123 fs_list_for_each_entry(pos, &(fg)->node.children)
125 #define fs_for_each_dst(pos, fte) \
126 fs_list_for_each_entry(pos, &(fte)->node.children)