mirror of
https://github.com/corundum/corundum.git
synced 2025-01-16 08:12:53 +08:00
125 lines
3.5 KiB
C
125 lines
3.5 KiB
C
// SPDX-License-Identifier: BSD-2-Clause-Views
|
|
/*
|
|
* Copyright 2021, The Regents of the University of California.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above
|
|
* copyright notice, this list of conditions and the following
|
|
* disclaimer in the documentation and/or other materials provided
|
|
* with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
* The views and conclusions contained in the software and documentation
|
|
* are those of the authors and should not be interpreted as representing
|
|
* official policies, either expressed or implied, of The Regents of the
|
|
* University of California.
|
|
*/
|
|
|
|
#include "mqnic.h"
|
|
|
|
struct mqnic_reg_block *mqnic_enumerate_reg_block_list(u8 __iomem *base, size_t offset, size_t size)
|
|
{
|
|
int max_count = 8;
|
|
struct mqnic_reg_block *reg_block_list = kzalloc(max_count * sizeof(struct mqnic_reg_block), GFP_KERNEL);
|
|
int count = 0;
|
|
int k;
|
|
|
|
u8 __iomem *ptr;
|
|
|
|
u32 rb_type;
|
|
u32 rb_version;
|
|
|
|
if (!reg_block_list)
|
|
return NULL;
|
|
|
|
while (1) {
|
|
reg_block_list[count].type = 0;
|
|
reg_block_list[count].version = 0;
|
|
reg_block_list[count].base = 0;
|
|
reg_block_list[count].regs = 0;
|
|
|
|
if ((offset == 0 && count != 0) || offset >= size)
|
|
break;
|
|
|
|
ptr = base + offset;
|
|
|
|
for (k = 0; k < count; k++)
|
|
{
|
|
if (ptr == reg_block_list[k].regs)
|
|
{
|
|
pr_err("Register blocks form a loop");
|
|
goto fail;
|
|
}
|
|
}
|
|
|
|
rb_type = ioread32(ptr + MQNIC_RB_REG_TYPE);
|
|
rb_version = ioread32(ptr + MQNIC_RB_REG_VER);
|
|
offset = ioread32(ptr + MQNIC_RB_REG_NEXT_PTR);
|
|
|
|
reg_block_list[count].type = rb_type;
|
|
reg_block_list[count].version = rb_version;
|
|
reg_block_list[count].base = base;
|
|
reg_block_list[count].regs = ptr;
|
|
|
|
count++;
|
|
|
|
if (count >= max_count) {
|
|
struct mqnic_reg_block *tmp;
|
|
max_count += 4;
|
|
tmp = krealloc(reg_block_list, max_count * sizeof(struct mqnic_reg_block), GFP_KERNEL);
|
|
if (!tmp)
|
|
goto fail;
|
|
reg_block_list = tmp;
|
|
}
|
|
}
|
|
|
|
return reg_block_list;
|
|
fail:
|
|
kfree(reg_block_list);
|
|
return NULL;
|
|
}
|
|
EXPORT_SYMBOL(mqnic_enumerate_reg_block_list);
|
|
|
|
struct mqnic_reg_block *mqnic_find_reg_block(struct mqnic_reg_block *list, u32 type, u32 version, int index)
|
|
{
|
|
struct mqnic_reg_block *rb = list;
|
|
|
|
while (rb->regs) {
|
|
if (rb->type == type && (!version || rb->version == version)) {
|
|
if (index > 0)
|
|
index--;
|
|
else
|
|
return rb;
|
|
}
|
|
|
|
rb++;
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
EXPORT_SYMBOL(mqnic_find_reg_block);
|
|
|
|
void mqnic_free_reg_block_list(struct mqnic_reg_block *list)
|
|
{
|
|
kfree(list);
|
|
}
|
|
EXPORT_SYMBOL(mqnic_free_reg_block_list);
|