Subversion Repositories HelenOS

Rev

Rev 4220 | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 4220 Rev 4490
1
/*
1
/*
2
 * Copyright (c) 2006 Jakub Jermar
2
 * Copyright (c) 2006 Jakub Jermar
3
 * All rights reserved.
3
 * All rights reserved.
4
 *
4
 *
5
 * Redistribution and use in source and binary forms, with or without
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions
6
 * modification, are permitted provided that the following conditions
7
 * are met:
7
 * are met:
8
 *
8
 *
9
 * - Redistributions of source code must retain the above copyright
9
 * - Redistributions of source code must retain the above copyright
10
 *   notice, this list of conditions and the following disclaimer.
10
 *   notice, this list of conditions and the following disclaimer.
11
 * - Redistributions in binary form must reproduce the above copyright
11
 * - Redistributions in binary form must reproduce the above copyright
12
 *   notice, this list of conditions and the following disclaimer in the
12
 *   notice, this list of conditions and the following disclaimer in the
13
 *   documentation and/or other materials provided with the distribution.
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
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.
15
 *   derived from this software without specific prior written permission.
16
 *
16
 *
17
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
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
18
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
19
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
20
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
21
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
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
23
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
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
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.
26
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
 */
27
 */
28
 
28
 
29
/** @addtogroup ofw
29
/** @addtogroup ofw
30
 * @{
30
 * @{
31
 */
31
 */
32
/**
32
/**
33
 * @file
33
 * @file
34
 * @brief   FHC 'reg' and 'ranges' properties handling.
34
 * @brief   FHC 'reg' and 'ranges' properties handling.
35
 *
35
 *
36
 */
36
 */
37
 
37
 
38
#include <genarch/ofw/ofw_tree.h>
38
#include <genarch/ofw/ofw_tree.h>
39
#include <arch/drivers/fhc.h>
39
#include <arch/drivers/fhc.h>
40
#include <arch/memstr.h>
40
#include <arch/memstr.h>
41
#include <string.h>
41
#include <string.h>
42
#include <panic.h>
42
#include <panic.h>
43
#include <macros.h>
43
#include <macros.h>
44
 
44
 
45
bool ofw_fhc_apply_ranges(ofw_tree_node_t *node, ofw_fhc_reg_t *reg, uintptr_t *pa)
45
bool ofw_fhc_apply_ranges(ofw_tree_node_t *node, ofw_fhc_reg_t *reg, uintptr_t *pa)
46
{
46
{
47
    ofw_tree_property_t *prop;
47
    ofw_tree_property_t *prop;
48
    ofw_fhc_range_t *range;
48
    ofw_fhc_range_t *range;
49
    count_t ranges;
49
    size_t ranges;
50
 
50
 
51
    prop = ofw_tree_getprop(node, "ranges");
51
    prop = ofw_tree_getprop(node, "ranges");
52
    if (!prop)
52
    if (!prop)
53
        return false;
53
        return false;
54
       
54
       
55
    ranges = prop->size / sizeof(ofw_fhc_range_t);
55
    ranges = prop->size / sizeof(ofw_fhc_range_t);
56
    range = prop->value;
56
    range = prop->value;
57
   
57
   
58
    unsigned int i;
58
    unsigned int i;
59
   
59
   
60
    for (i = 0; i < ranges; i++) {
60
    for (i = 0; i < ranges; i++) {
61
        if (overlaps(reg->addr, reg->size, range[i].child_base, range[i].size)) {
61
        if (overlaps(reg->addr, reg->size, range[i].child_base, range[i].size)) {
62
            uintptr_t addr;
62
            uintptr_t addr;
63
           
63
           
64
            addr = range[i].parent_base + (reg->addr - range[i].child_base);
64
            addr = range[i].parent_base + (reg->addr - range[i].child_base);
65
            if (!node->parent->parent) {
65
            if (!node->parent->parent) {
66
                *pa = addr;
66
                *pa = addr;
67
                return true;
67
                return true;
68
            }
68
            }
69
            if (str_cmp(ofw_tree_node_name(node->parent), "central") != 0)
69
            if (str_cmp(ofw_tree_node_name(node->parent), "central") != 0)
70
                panic("Unexpected parent node: %s.", ofw_tree_node_name(node->parent));
70
                panic("Unexpected parent node: %s.", ofw_tree_node_name(node->parent));
71
           
71
           
72
            ofw_central_reg_t central_reg;
72
            ofw_central_reg_t central_reg;
73
           
73
           
74
            central_reg.addr = addr;
74
            central_reg.addr = addr;
75
            central_reg.size = reg->size;
75
            central_reg.size = reg->size;
76
           
76
           
77
            return ofw_central_apply_ranges(node->parent, &central_reg, pa);
77
            return ofw_central_apply_ranges(node->parent, &central_reg, pa);
78
        }
78
        }
79
    }
79
    }
80
 
80
 
81
    return false;
81
    return false;
82
}
82
}
83
 
83
 
84
bool ofw_central_apply_ranges(ofw_tree_node_t *node, ofw_central_reg_t *reg, uintptr_t *pa)
84
bool ofw_central_apply_ranges(ofw_tree_node_t *node, ofw_central_reg_t *reg, uintptr_t *pa)
85
{
85
{
86
    if (node->parent->parent)
86
    if (node->parent->parent)
87
        panic("Unexpected parent node: %s.", ofw_tree_node_name(node->parent));
87
        panic("Unexpected parent node: %s.", ofw_tree_node_name(node->parent));
88
   
88
   
89
    ofw_tree_property_t *prop;
89
    ofw_tree_property_t *prop;
90
    ofw_central_range_t *range;
90
    ofw_central_range_t *range;
91
    count_t ranges;
91
    size_t ranges;
92
   
92
   
93
    prop = ofw_tree_getprop(node, "ranges");
93
    prop = ofw_tree_getprop(node, "ranges");
94
    if (!prop)
94
    if (!prop)
95
        return false;
95
        return false;
96
       
96
       
97
    ranges = prop->size / sizeof(ofw_central_range_t);
97
    ranges = prop->size / sizeof(ofw_central_range_t);
98
    range = prop->value;
98
    range = prop->value;
99
   
99
   
100
    unsigned int i;
100
    unsigned int i;
101
   
101
   
102
    for (i = 0; i < ranges; i++) {
102
    for (i = 0; i < ranges; i++) {
103
        if (overlaps(reg->addr, reg->size, range[i].child_base, range[i].size)) {
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);
104
            *pa = range[i].parent_base + (reg->addr - range[i].child_base);
105
            return true;
105
            return true;
106
        }
106
        }
107
    }
107
    }
108
   
108
   
109
    return false;
109
    return false;
110
}
110
}
111
 
111
 
112
bool
112
bool
113
ofw_fhc_map_interrupt(ofw_tree_node_t *node, ofw_fhc_reg_t *reg,
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)
114
    uint32_t interrupt, int *inr, cir_t *cir, void **cir_arg)
115
{
115
{
116
    fhc_t *fhc = NULL;
116
    fhc_t *fhc = NULL;
117
    if (!node->device) {
117
    if (!node->device) {
118
        fhc = fhc_init(node);
118
        fhc = fhc_init(node);
119
        if (!fhc)
119
        if (!fhc)
120
            return false;
120
            return false;
121
        node->device = fhc;
121
        node->device = fhc;
122
        central_fhc = fhc;
122
        central_fhc = fhc;
123
    }
123
    }
124
   
124
   
125
    /*
125
    /*
126
     * The interrupt controller for the interrupt is the FHC itself.
126
     * The interrupt controller for the interrupt is the FHC itself.
127
     */
127
     */
128
    fhc_enable_interrupt(fhc, interrupt);
128
    fhc_enable_interrupt(fhc, interrupt);
129
   
129
   
130
    *inr = interrupt;
130
    *inr = interrupt;
131
    *cir = fhc_clear_interrupt;
131
    *cir = fhc_clear_interrupt;
132
    *cir_arg = fhc;
132
    *cir_arg = fhc;
133
    return true;
133
    return true;
134
}
134
}
135
 
135
 
136
/** @}
136
/** @}
137
 */
137
 */
138
 
138