1*3b2324c3SHans Petter Selasky /*- 2*3b2324c3SHans Petter Selasky * SPDX-License-Identifier: BSD-3-Clause 3*3b2324c3SHans Petter Selasky * 4*3b2324c3SHans Petter Selasky * Copyright (c) 2017-2019 Mellanox Technologies. 5*3b2324c3SHans Petter Selasky * All rights reserved. 6*3b2324c3SHans Petter Selasky * 7*3b2324c3SHans Petter Selasky * Redistribution and use in source and binary forms, with or without 8*3b2324c3SHans Petter Selasky * modification, are permitted provided that the following conditions 9*3b2324c3SHans Petter Selasky * are met: 10*3b2324c3SHans Petter Selasky * 1. Redistributions of source code must retain the above copyright 11*3b2324c3SHans Petter Selasky * notice, this list of conditions and the following disclaimer. 12*3b2324c3SHans Petter Selasky * 2. Redistributions in binary form must reproduce the above copyright 13*3b2324c3SHans Petter Selasky * notice, this list of conditions and the following disclaimer in the 14*3b2324c3SHans Petter Selasky * documentation and/or other materials provided with the distribution. 15*3b2324c3SHans Petter Selasky * 3. Neither the name of Mellanox nor the names of contributors 16*3b2324c3SHans Petter Selasky * may be used to endorse or promote products derived from this software 17*3b2324c3SHans Petter Selasky * without specific prior written permission. 18*3b2324c3SHans Petter Selasky * 19*3b2324c3SHans Petter Selasky * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 20*3b2324c3SHans Petter Selasky * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21*3b2324c3SHans Petter Selasky * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22*3b2324c3SHans Petter Selasky * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 23*3b2324c3SHans Petter Selasky * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24*3b2324c3SHans Petter Selasky * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25*3b2324c3SHans Petter Selasky * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26*3b2324c3SHans Petter Selasky * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27*3b2324c3SHans Petter Selasky * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28*3b2324c3SHans Petter Selasky * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29*3b2324c3SHans Petter Selasky * SUCH DAMAGE. 30*3b2324c3SHans Petter Selasky */ 31*3b2324c3SHans Petter Selasky 32*3b2324c3SHans Petter Selasky #ifndef _MLXFW_MFA2_TLV_MULTI_H 33*3b2324c3SHans Petter Selasky #define _MLXFW_MFA2_TLV_MULTI_H 34*3b2324c3SHans Petter Selasky 35*3b2324c3SHans Petter Selasky #include "mlxfw_mfa2_tlv.h" 36*3b2324c3SHans Petter Selasky #include "mlxfw_mfa2_format.h" 37*3b2324c3SHans Petter Selasky #include "mlxfw_mfa2_file.h" 38*3b2324c3SHans Petter Selasky 39*3b2324c3SHans Petter Selasky const struct mlxfw_mfa2_tlv * 40*3b2324c3SHans Petter Selasky mlxfw_mfa2_tlv_multi_child(const struct mlxfw_mfa2_file *mfa2_file, 41*3b2324c3SHans Petter Selasky const struct mlxfw_mfa2_tlv_multi *multi); 42*3b2324c3SHans Petter Selasky 43*3b2324c3SHans Petter Selasky const struct mlxfw_mfa2_tlv * 44*3b2324c3SHans Petter Selasky mlxfw_mfa2_tlv_next(const struct mlxfw_mfa2_file *mfa2_file, 45*3b2324c3SHans Petter Selasky const struct mlxfw_mfa2_tlv *tlv); 46*3b2324c3SHans Petter Selasky 47*3b2324c3SHans Petter Selasky const struct mlxfw_mfa2_tlv * 48*3b2324c3SHans Petter Selasky mlxfw_mfa2_tlv_advance(const struct mlxfw_mfa2_file *mfa2_file, 49*3b2324c3SHans Petter Selasky const struct mlxfw_mfa2_tlv *from_tlv, u16 count); 50*3b2324c3SHans Petter Selasky 51*3b2324c3SHans Petter Selasky const struct mlxfw_mfa2_tlv * 52*3b2324c3SHans Petter Selasky mlxfw_mfa2_tlv_multi_child_find(const struct mlxfw_mfa2_file *mfa2_file, 53*3b2324c3SHans Petter Selasky const struct mlxfw_mfa2_tlv_multi *multi, 54*3b2324c3SHans Petter Selasky enum mlxfw_mfa2_tlv_type type, u16 index); 55*3b2324c3SHans Petter Selasky 56*3b2324c3SHans Petter Selasky int mlxfw_mfa2_tlv_multi_child_count(const struct mlxfw_mfa2_file *mfa2_file, 57*3b2324c3SHans Petter Selasky const struct mlxfw_mfa2_tlv_multi *multi, 58*3b2324c3SHans Petter Selasky enum mlxfw_mfa2_tlv_type type, 59*3b2324c3SHans Petter Selasky u16 *p_count); 60*3b2324c3SHans Petter Selasky 61*3b2324c3SHans Petter Selasky #define mlxfw_mfa2_tlv_foreach(mfa2_file, tlv, idx, from_tlv, count) \ 62*3b2324c3SHans Petter Selasky for (idx = 0, tlv = from_tlv; idx < (count); \ 63*3b2324c3SHans Petter Selasky idx++, tlv = mlxfw_mfa2_tlv_next(mfa2_file, tlv)) 64*3b2324c3SHans Petter Selasky 65*3b2324c3SHans Petter Selasky #define mlxfw_mfa2_tlv_multi_foreach(mfa2_file, tlv, idx, multi) \ 66*3b2324c3SHans Petter Selasky mlxfw_mfa2_tlv_foreach(mfa2_file, tlv, idx, \ 67*3b2324c3SHans Petter Selasky mlxfw_mfa2_tlv_multi_child(mfa2_file, multi), \ 68*3b2324c3SHans Petter Selasky be16_to_cpu(multi->num_extensions) + 1) 69*3b2324c3SHans Petter Selasky #endif 70