blob: a031e45c8b0634213dde81fb81f78f34391627df [file] [log] [blame]
Jiri Pirkoc1a38312016-10-21 16:07:23 +02001/*
2 * drivers/net/ethernet/mellanox/mlxsw/resources.h
3 * Copyright (c) 2016 Mellanox Technologies. All rights reserved.
4 * Copyright (c) 2016 Jiri Pirko <jiri@mellanox.com>
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are met:
8 *
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * 3. Neither the names of the copyright holders nor the names of its
15 * contributors may be used to endorse or promote products derived from
16 * this software without specific prior written permission.
17 *
18 * Alternatively, this software may be distributed under the terms of the
19 * GNU General Public License ("GPL") version 2 as published by the Free
20 * Software Foundation.
21 *
22 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
23 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
26 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
27 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
28 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
29 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
30 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
31 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
32 * POSSIBILITY OF SUCH DAMAGE.
33 */
34
35#ifndef _MLXSW_RESOURCES_H
36#define _MLXSW_RESOURCES_H
37
38#include <linux/kernel.h>
39#include <linux/types.h>
40
41enum mlxsw_res_id {
42 MLXSW_RES_ID_KVD_SIZE,
43 MLXSW_RES_ID_KVD_SINGLE_MIN_SIZE,
44 MLXSW_RES_ID_KVD_DOUBLE_MIN_SIZE,
45 MLXSW_RES_ID_MAX_SPAN,
46 MLXSW_RES_ID_MAX_SYSTEM_PORT,
47 MLXSW_RES_ID_MAX_LAG,
48 MLXSW_RES_ID_MAX_LAG_MEMBERS,
49 MLXSW_RES_ID_MAX_VRS,
50 MLXSW_RES_ID_MAX_RIFS,
51
52 /* Internal resources.
53 * Determined by the SW, not queried from the HW.
54 */
55 MLXSW_RES_ID_KVD_SINGLE_SIZE,
56 MLXSW_RES_ID_KVD_DOUBLE_SIZE,
57 MLXSW_RES_ID_KVD_LINEAR_SIZE,
58
59 __MLXSW_RES_ID_MAX,
60};
61
62static u16 mlxsw_res_ids[] = {
63 [MLXSW_RES_ID_KVD_SIZE] = 0x1001,
64 [MLXSW_RES_ID_KVD_SINGLE_MIN_SIZE] = 0x1002,
65 [MLXSW_RES_ID_KVD_DOUBLE_MIN_SIZE] = 0x1003,
66 [MLXSW_RES_ID_MAX_SPAN] = 0x2420,
67 [MLXSW_RES_ID_MAX_SYSTEM_PORT] = 0x2502,
68 [MLXSW_RES_ID_MAX_LAG] = 0x2520,
69 [MLXSW_RES_ID_MAX_LAG_MEMBERS] = 0x2521,
70 [MLXSW_RES_ID_MAX_VRS] = 0x2C01,
71 [MLXSW_RES_ID_MAX_RIFS] = 0x2C02,
72};
73
74struct mlxsw_res {
75 bool valid[__MLXSW_RES_ID_MAX];
76 u64 values[__MLXSW_RES_ID_MAX];
77};
78
79static inline bool mlxsw_res_valid(struct mlxsw_res *res,
80 enum mlxsw_res_id res_id)
81{
82 return res->valid[res_id];
83}
84
85#define MLXSW_RES_VALID(res, short_res_id) \
86 mlxsw_res_valid(res, MLXSW_RES_ID_##short_res_id)
87
88static inline u64 mlxsw_res_get(struct mlxsw_res *res,
89 enum mlxsw_res_id res_id)
90{
91 if (WARN_ON(!res->valid[res_id]))
92 return 0;
93 return res->values[res_id];
94}
95
96#define MLXSW_RES_GET(res, short_res_id) \
97 mlxsw_res_get(res, MLXSW_RES_ID_##short_res_id)
98
99static inline void mlxsw_res_set(struct mlxsw_res *res,
100 enum mlxsw_res_id res_id, u64 value)
101{
102 res->valid[res_id] = true;
103 res->values[res_id] = value;
104}
105
106#define MLXSW_RES_SET(res, short_res_id, value) \
107 mlxsw_res_set(res, MLXSW_RES_ID_##short_res_id, value)
108
109static inline void mlxsw_res_parse(struct mlxsw_res *res, u16 id, u64 value)
110{
111 int i;
112
113 for (i = 0; i < ARRAY_SIZE(mlxsw_res_ids); i++) {
114 if (mlxsw_res_ids[i] == id) {
115 mlxsw_res_set(res, i, value);
116 return;
117 }
118 }
119}
120
121#endif