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