| 1 | /*
|
|---|
| 2 | * Copyright (c) 2006 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 FHC 'reg' and 'ranges' properties handling.
|
|---|
| 35 | *
|
|---|
| 36 | */
|
|---|
| 37 |
|
|---|
| 38 | #include <genarch/ofw/ofw_tree.h>
|
|---|
| 39 | #include <genarch/ofw/fhc.h>
|
|---|
| 40 | #include <arch/drivers/fhc.h>
|
|---|
| 41 | #include <arch/memstr.h>
|
|---|
| 42 | #include <string.h>
|
|---|
| 43 | #include <panic.h>
|
|---|
| 44 | #include <macros.h>
|
|---|
| 45 |
|
|---|
| 46 | bool ofw_fhc_apply_ranges(ofw_tree_node_t *node, ofw_fhc_reg_t *reg, uintptr_t *pa)
|
|---|
| 47 | {
|
|---|
| 48 | ofw_tree_property_t *prop;
|
|---|
| 49 | ofw_fhc_range_t *range;
|
|---|
| 50 | size_t ranges;
|
|---|
| 51 |
|
|---|
| 52 | prop = ofw_tree_getprop(node, "ranges");
|
|---|
| 53 | if (!prop)
|
|---|
| 54 | return false;
|
|---|
| 55 |
|
|---|
| 56 | ranges = prop->size / sizeof(ofw_fhc_range_t);
|
|---|
| 57 | range = prop->value;
|
|---|
| 58 |
|
|---|
| 59 | unsigned int i;
|
|---|
| 60 |
|
|---|
| 61 | for (i = 0; i < ranges; i++) {
|
|---|
| 62 | if (overlaps(reg->addr, reg->size, range[i].child_base, range[i].size)) {
|
|---|
| 63 | uintptr_t addr;
|
|---|
| 64 |
|
|---|
| 65 | addr = range[i].parent_base + (reg->addr - range[i].child_base);
|
|---|
| 66 | if (!node->parent->parent) {
|
|---|
| 67 | *pa = addr;
|
|---|
| 68 | return true;
|
|---|
| 69 | }
|
|---|
| 70 | if (str_cmp(ofw_tree_node_name(node->parent), "central") != 0)
|
|---|
| 71 | panic("Unexpected parent node: %s.", ofw_tree_node_name(node->parent));
|
|---|
| 72 |
|
|---|
| 73 | ofw_central_reg_t central_reg;
|
|---|
| 74 |
|
|---|
| 75 | central_reg.addr = addr;
|
|---|
| 76 | central_reg.size = reg->size;
|
|---|
| 77 |
|
|---|
| 78 | return ofw_central_apply_ranges(node->parent, ¢ral_reg, pa);
|
|---|
| 79 | }
|
|---|
| 80 | }
|
|---|
| 81 |
|
|---|
| 82 | return false;
|
|---|
| 83 | }
|
|---|
| 84 |
|
|---|
| 85 | bool ofw_central_apply_ranges(ofw_tree_node_t *node, ofw_central_reg_t *reg, uintptr_t *pa)
|
|---|
| 86 | {
|
|---|
| 87 | if (node->parent->parent)
|
|---|
| 88 | panic("Unexpected parent node: %s.", ofw_tree_node_name(node->parent));
|
|---|
| 89 |
|
|---|
| 90 | ofw_tree_property_t *prop;
|
|---|
| 91 | ofw_central_range_t *range;
|
|---|
| 92 | size_t ranges;
|
|---|
| 93 |
|
|---|
| 94 | prop = ofw_tree_getprop(node, "ranges");
|
|---|
| 95 | if (!prop)
|
|---|
| 96 | return false;
|
|---|
| 97 |
|
|---|
| 98 | ranges = prop->size / sizeof(ofw_central_range_t);
|
|---|
| 99 | range = prop->value;
|
|---|
| 100 |
|
|---|
| 101 | unsigned int i;
|
|---|
| 102 |
|
|---|
| 103 | for (i = 0; i < ranges; i++) {
|
|---|
| 104 | if (overlaps(reg->addr, reg->size, range[i].child_base, range[i].size)) {
|
|---|
| 105 | *pa = range[i].parent_base + (reg->addr - range[i].child_base);
|
|---|
| 106 | return true;
|
|---|
| 107 | }
|
|---|
| 108 | }
|
|---|
| 109 |
|
|---|
| 110 | return false;
|
|---|
| 111 | }
|
|---|
| 112 |
|
|---|
| 113 | bool
|
|---|
| 114 | ofw_fhc_map_interrupt(ofw_tree_node_t *node, ofw_fhc_reg_t *reg,
|
|---|
| 115 | uint32_t interrupt, int *inr, cir_t *cir, void **cir_arg)
|
|---|
| 116 | {
|
|---|
| 117 | fhc_t *fhc = NULL;
|
|---|
| 118 | if (!node->device) {
|
|---|
| 119 | fhc = fhc_init(node);
|
|---|
| 120 | if (!fhc)
|
|---|
| 121 | return false;
|
|---|
| 122 | node->device = fhc;
|
|---|
| 123 | central_fhc = fhc;
|
|---|
| 124 | }
|
|---|
| 125 |
|
|---|
| 126 | /*
|
|---|
| 127 | * The interrupt controller for the interrupt is the FHC itself.
|
|---|
| 128 | */
|
|---|
| 129 | fhc_enable_interrupt(fhc, interrupt);
|
|---|
| 130 |
|
|---|
| 131 | *inr = interrupt;
|
|---|
| 132 | *cir = fhc_clear_interrupt;
|
|---|
| 133 | *cir_arg = fhc;
|
|---|
| 134 | return true;
|
|---|
| 135 | }
|
|---|
| 136 |
|
|---|
| 137 | /** @}
|
|---|
| 138 | */
|
|---|