| 1 | /*
|
|---|
| 2 | * Copyright (c) 2007 Jakub Jermar
|
|---|
| 3 | * All rights reserved.
|
|---|
| 4 | *
|
|---|
| 5 | * Redistribution and use in source and binary forms, with or without
|
|---|
| 6 | * modification, are permitted provided that the following conditions
|
|---|
| 7 | * are met:
|
|---|
| 8 | *
|
|---|
| 9 | * - Redistributions of source code must retain the above copyright
|
|---|
| 10 | * notice, this list of conditions and the following disclaimer.
|
|---|
| 11 | * - 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 | * - The name of the author may not be used to endorse or promote products
|
|---|
| 15 | * derived from this software without specific prior written permission.
|
|---|
| 16 | *
|
|---|
| 17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|---|
| 18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|---|
| 19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|---|
| 20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|---|
| 21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|---|
| 22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|---|
| 23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|---|
| 24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|---|
| 25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|---|
| 26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|---|
| 27 | */
|
|---|
| 28 |
|
|---|
| 29 | /** @addtogroup kernel_genarch
|
|---|
| 30 | * @{
|
|---|
| 31 | */
|
|---|
| 32 | /**
|
|---|
| 33 | * @file
|
|---|
| 34 | * @brief SBUS 'reg' and 'ranges' properties handling.
|
|---|
| 35 | *
|
|---|
| 36 | */
|
|---|
| 37 |
|
|---|
| 38 | #include <genarch/ofw/ofw_tree.h>
|
|---|
| 39 | #include <genarch/ofw/sbus.h>
|
|---|
| 40 | #include <macros.h>
|
|---|
| 41 |
|
|---|
| 42 | bool ofw_sbus_apply_ranges(ofw_tree_node_t *node, ofw_sbus_reg_t *reg,
|
|---|
| 43 | uintptr_t *pa)
|
|---|
| 44 | {
|
|---|
| 45 | ofw_tree_property_t *prop;
|
|---|
| 46 | ofw_sbus_range_t *range;
|
|---|
| 47 | size_t ranges;
|
|---|
| 48 |
|
|---|
| 49 | /*
|
|---|
| 50 | * The SBUS support is very rudimentary in that we simply assume
|
|---|
| 51 | * that the SBUS bus in question is connected directly to the UPA bus.
|
|---|
| 52 | * Should we come across configurations that need more robust support,
|
|---|
| 53 | * the driver will have to be extended to handle different topologies.
|
|---|
| 54 | */
|
|---|
| 55 | if (!node->parent || node->parent->parent)
|
|---|
| 56 | return false;
|
|---|
| 57 |
|
|---|
| 58 | prop = ofw_tree_getprop(node, "ranges");
|
|---|
| 59 | if (!prop)
|
|---|
| 60 | return false;
|
|---|
| 61 |
|
|---|
| 62 | ranges = prop->size / sizeof(ofw_sbus_range_t);
|
|---|
| 63 | range = prop->value;
|
|---|
| 64 |
|
|---|
| 65 | unsigned int i;
|
|---|
| 66 |
|
|---|
| 67 | for (i = 0; i < ranges; i++) {
|
|---|
| 68 | if (overlaps(reg->addr, reg->size, range[i].child_base,
|
|---|
| 69 | range[i].size)) {
|
|---|
| 70 | *pa = range[i].parent_base +
|
|---|
| 71 | (reg->addr - range[i].child_base);
|
|---|
| 72 | return true;
|
|---|
| 73 | }
|
|---|
| 74 | }
|
|---|
| 75 |
|
|---|
| 76 | return false;
|
|---|
| 77 | }
|
|---|
| 78 |
|
|---|
| 79 | /** @}
|
|---|
| 80 | */
|
|---|
