Rev 2787 | Details | Compare with Previous | Last modification | View Log | RSS feed
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 2510 | jermar | 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 ofw |
||
| 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 <macros.h> |
||
| 40 | |||
| 41 | bool ofw_sbus_apply_ranges(ofw_tree_node_t *node, ofw_sbus_reg_t *reg, |
||
| 42 | uintptr_t *pa) |
||
| 43 | { |
||
| 44 | ofw_tree_property_t *prop; |
||
| 45 | ofw_sbus_range_t *range; |
||
| 4692 | svoboda | 46 | size_t ranges; |
| 2510 | jermar | 47 | |
| 48 | /* |
||
| 49 | * The SBUS support is very rudimentary in that we simply assume |
||
| 50 | * that the SBUS bus in question is connected directly to the UPA bus. |
||
| 51 | * Should we come across configurations that need more robust support, |
||
| 52 | * the driver will have to be extended to handle different topologies. |
||
| 53 | */ |
||
| 54 | if (!node->parent || node->parent->parent) |
||
| 55 | return false; |
||
| 56 | |||
| 57 | prop = ofw_tree_getprop(node, "ranges"); |
||
| 58 | if (!prop) |
||
| 59 | return false; |
||
| 60 | |||
| 61 | ranges = prop->size / sizeof(ofw_sbus_range_t); |
||
| 62 | range = prop->value; |
||
| 63 | |||
| 2745 | decky | 64 | unsigned int i; |
| 2510 | jermar | 65 | |
| 66 | for (i = 0; i < ranges; i++) { |
||
| 67 | if (overlaps(reg->addr, reg->size, range[i].child_base, |
||
| 68 | range[i].size)) { |
||
| 69 | *pa = range[i].parent_base + |
||
| 70 | (reg->addr - range[i].child_base); |
||
| 71 | return true; |
||
| 72 | } |
||
| 73 | } |
||
| 74 | |||
| 75 | return false; |
||
| 76 | } |
||
| 77 | |||
| 78 | /** @} |
||
| 79 | */ |