1/*-
2 * SPDX-License-Identifier: BSD-3-Clause
3 *
4 * Copyright (c) 2017-2019 Mellanox Technologies.
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 *    notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 *    notice, this list of conditions and the following disclaimer in the
14 *    documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of Mellanox nor the names of contributors
16 *    may be used to endorse or promote products derived from this software
17 *    without specific prior written permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * SUCH DAMAGE.
30 */
31
32#define pr_fmt(fmt) "MFA2: " fmt
33
34#include "mlxfw_mfa2_tlv_multi.h"
35
36#define MLXFW_MFA2_TLV_TOTAL_SIZE(tlv) \
37	NLA_ALIGN(sizeof(*(tlv)) + be16_to_cpu((tlv)->len))
38
39const struct mlxfw_mfa2_tlv *
40mlxfw_mfa2_tlv_multi_child(const struct mlxfw_mfa2_file *mfa2_file,
41			   const struct mlxfw_mfa2_tlv_multi *multi)
42{
43	size_t multi_len;
44
45	multi_len = NLA_ALIGN(sizeof(struct mlxfw_mfa2_tlv_multi));
46	return mlxfw_mfa2_tlv_get(mfa2_file, (const u8 *) multi + multi_len);
47}
48
49const struct mlxfw_mfa2_tlv *
50mlxfw_mfa2_tlv_next(const struct mlxfw_mfa2_file *mfa2_file,
51		    const struct mlxfw_mfa2_tlv *tlv)
52{
53	const struct mlxfw_mfa2_tlv_multi *multi;
54	u16 tlv_len;
55	const u8 *next;
56
57	tlv_len = MLXFW_MFA2_TLV_TOTAL_SIZE(tlv);
58
59	if (tlv->type == MLXFW_MFA2_TLV_MULTI_PART) {
60		multi = mlxfw_mfa2_tlv_multi_get(mfa2_file, tlv);
61		if (!multi)
62			return NULL;
63		tlv_len = NLA_ALIGN(tlv_len + be16_to_cpu(multi->total_len));
64	}
65
66	next = (const u8 *) tlv + tlv_len;
67	return mlxfw_mfa2_tlv_get(mfa2_file, next);
68}
69
70const struct mlxfw_mfa2_tlv *
71mlxfw_mfa2_tlv_advance(const struct mlxfw_mfa2_file *mfa2_file,
72		       const struct mlxfw_mfa2_tlv *from_tlv, u16 count)
73{
74	const struct mlxfw_mfa2_tlv *tlv;
75	u16 idx;
76
77	mlxfw_mfa2_tlv_foreach(mfa2_file, tlv, idx, from_tlv, count)
78		if (!tlv)
79			return NULL;
80	return tlv;
81}
82
83const struct mlxfw_mfa2_tlv *
84mlxfw_mfa2_tlv_multi_child_find(const struct mlxfw_mfa2_file *mfa2_file,
85				const struct mlxfw_mfa2_tlv_multi *multi,
86				enum mlxfw_mfa2_tlv_type type, u16 index)
87{
88	const struct mlxfw_mfa2_tlv *tlv;
89	u16 skip = 0;
90	u16 idx;
91
92	mlxfw_mfa2_tlv_multi_foreach(mfa2_file, tlv, idx, multi) {
93		if (!tlv) {
94			pr_err("TLV parsing error\n");
95			return NULL;
96		}
97		if (tlv->type == type)
98			if (skip++ == index)
99				return tlv;
100	}
101	return NULL;
102}
103
104int mlxfw_mfa2_tlv_multi_child_count(const struct mlxfw_mfa2_file *mfa2_file,
105				     const struct mlxfw_mfa2_tlv_multi *multi,
106				     enum mlxfw_mfa2_tlv_type type,
107				     u16 *p_count)
108{
109	const struct mlxfw_mfa2_tlv *tlv;
110	u16 count = 0;
111	u16 idx;
112
113	mlxfw_mfa2_tlv_multi_foreach(mfa2_file, tlv, idx, multi) {
114		if (!tlv) {
115			pr_err("TLV parsing error\n");
116			return -EINVAL;
117		}
118
119		if (tlv->type == type)
120			count++;
121	}
122	*p_count = count;
123	return 0;
124}
125