Subversion Repositories HelenOS

Rev

Rev 4153 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 4153 Rev 4263
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   EBUS 'reg' and 'ranges' properties handling.
34
 * @brief   EBUS '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/memstr.h>
39
#include <arch/memstr.h>
40
#include <arch/trap/interrupt.h>
40
#include <arch/trap/interrupt.h>
41
#include <string.h>
41
#include <string.h>
42
#include <panic.h>
42
#include <panic.h>
43
#include <debug.h>
43
#include <debug.h>
44
#include <macros.h>
44
#include <macros.h>
45
 
45
 
46
/** Apply EBUS ranges to EBUS register. */
46
/** Apply EBUS ranges to EBUS register. */
47
bool
47
bool
48
ofw_ebus_apply_ranges(ofw_tree_node_t *node, ofw_ebus_reg_t *reg, uintptr_t *pa)
48
ofw_ebus_apply_ranges(ofw_tree_node_t *node, ofw_ebus_reg_t *reg, uintptr_t *pa)
49
{
49
{
50
    ofw_tree_property_t *prop;
50
    ofw_tree_property_t *prop;
51
    ofw_ebus_range_t *range;
51
    ofw_ebus_range_t *range;
52
    count_t ranges;
52
    count_t ranges;
53
 
53
 
54
    prop = ofw_tree_getprop(node, "ranges");
54
    prop = ofw_tree_getprop(node, "ranges");
55
    if (!prop)
55
    if (!prop)
56
        return false;
56
        return false;
57
       
57
       
58
    ranges = prop->size / sizeof(ofw_ebus_range_t);
58
    ranges = prop->size / sizeof(ofw_ebus_range_t);
59
    range = prop->value;
59
    range = prop->value;
60
   
60
   
61
    unsigned int i;
61
    unsigned int i;
62
   
62
   
63
    for (i = 0; i < ranges; i++) {
63
    for (i = 0; i < ranges; i++) {
64
        if (reg->space != range[i].child_space)
64
        if (reg->space != range[i].child_space)
65
            continue;
65
            continue;
66
        if (overlaps(reg->addr, reg->size, range[i].child_base,
66
        if (overlaps(reg->addr, reg->size, range[i].child_base,
67
            range[i].size)) {
67
            range[i].size)) {
68
            ofw_pci_reg_t pci_reg;
68
            ofw_pci_reg_t pci_reg;
69
           
69
           
70
            pci_reg.space = range[i].parent_space;
70
            pci_reg.space = range[i].parent_space;
71
            pci_reg.addr = range[i].parent_base +
71
            pci_reg.addr = range[i].parent_base +
72
                (reg->addr - range[i].child_base);
72
                (reg->addr - range[i].child_base);
73
            pci_reg.size = reg->size;
73
            pci_reg.size = reg->size;
74
           
74
           
75
            return ofw_pci_apply_ranges(node->parent, &pci_reg, pa);
75
            return ofw_pci_apply_ranges(node->parent, &pci_reg, pa);
76
        }
76
        }
77
    }
77
    }
78
 
78
 
79
    return false;
79
    return false;
80
}
80
}
81
 
81
 
82
bool
82
bool
83
ofw_ebus_map_interrupt(ofw_tree_node_t *node, ofw_ebus_reg_t *reg,
83
ofw_ebus_map_interrupt(ofw_tree_node_t *node, ofw_ebus_reg_t *reg,
84
    uint32_t interrupt, int *inr, cir_t *cir, void **cir_arg)
84
    uint32_t interrupt, int *inr, cir_t *cir, void **cir_arg)
85
{
85
{
86
    ofw_tree_property_t *prop;
86
    ofw_tree_property_t *prop;
87
    ofw_tree_node_t *controller;
87
    ofw_tree_node_t *controller;
88
   
88
   
89
    prop = ofw_tree_getprop(node, "interrupt-map");
89
    prop = ofw_tree_getprop(node, "interrupt-map");
90
    if (!prop || !prop->value)
90
    if (!prop || !prop->value)
91
        return false;
91
        return false;
92
 
92
 
93
    ofw_ebus_intr_map_t *intr_map = prop->value;
93
    ofw_ebus_intr_map_t *intr_map = prop->value;
94
    count_t count = prop->size / sizeof(ofw_ebus_intr_map_t);
94
    count_t count = prop->size / sizeof(ofw_ebus_intr_map_t);
95
   
95
   
96
    ASSERT(count);
96
    ASSERT(count);
97
   
97
   
98
    prop = ofw_tree_getprop(node, "interrupt-map-mask");
98
    prop = ofw_tree_getprop(node, "interrupt-map-mask");
99
    if (!prop || !prop->value)
99
    if (!prop || !prop->value)
100
        return false;
100
        return false;
101
   
101
   
102
    ofw_ebus_intr_mask_t *intr_mask = prop->value;
102
    ofw_ebus_intr_mask_t *intr_mask = prop->value;
103
   
103
   
104
    ASSERT(prop->size == sizeof(ofw_ebus_intr_mask_t));
104
    ASSERT(prop->size == sizeof(ofw_ebus_intr_mask_t));
105
   
105
   
106
    uint32_t space = reg->space & intr_mask->space_mask;
106
    uint32_t space = reg->space & intr_mask->space_mask;
107
    uint32_t addr = reg->addr & intr_mask->addr_mask;
107
    uint32_t addr = reg->addr & intr_mask->addr_mask;
108
    uint32_t intr = interrupt & intr_mask->intr_mask;
108
    uint32_t intr = interrupt & intr_mask->intr_mask;
109
   
109
   
110
    unsigned int i;
110
    unsigned int i;
111
    for (i = 0; i < count; i++) {
111
    for (i = 0; i < count; i++) {
112
        if ((intr_map[i].space == space) &&
112
        if ((intr_map[i].space == space) &&
113
            (intr_map[i].addr == addr) && (intr_map[i].intr == intr))
113
            (intr_map[i].addr == addr) && (intr_map[i].intr == intr))
114
            goto found;
114
            goto found;
115
    }
115
    }
116
    return false;
116
    return false;
117
 
117
 
118
found:
118
found:
119
    /*
119
    /*
120
     * We found the device that functions as an interrupt controller
120
     * We found the device that functions as an interrupt controller
121
     * for the interrupt. We also found partial mapping from interrupt to
121
     * for the interrupt. We also found partial mapping from interrupt to
122
     * INO.
122
     * INO.
123
     */
123
     */
124
 
124
 
125
    controller = ofw_tree_find_node_by_handle(ofw_tree_lookup("/"),
125
    controller = ofw_tree_find_node_by_handle(ofw_tree_lookup("/"),
126
        intr_map[i].controller_handle);
126
        intr_map[i].controller_handle);
127
    if (!controller)
127
    if (!controller)
128
        return false;
128
        return false;
129
       
129
       
130
    if (strcmp(ofw_tree_node_name(controller), "pci") != 0) {
130
    if (str_cmp(ofw_tree_node_name(controller), "pci") != 0) {
131
        /*
131
        /*
132
         * This is not a PCI node.
132
         * This is not a PCI node.
133
         */
133
         */
134
        return false;
134
        return false;
135
    }
135
    }
136
 
136
 
137
    /*
137
    /*
138
     * Let the PCI do the next step in mapping the interrupt.
138
     * Let the PCI do the next step in mapping the interrupt.
139
     */
139
     */
140
    if (!ofw_pci_map_interrupt(controller, NULL, intr_map[i].controller_ino,
140
    if (!ofw_pci_map_interrupt(controller, NULL, intr_map[i].controller_ino,
141
        inr, cir, cir_arg))
141
        inr, cir, cir_arg))
142
        return false;
142
        return false;
143
 
143
 
144
    return true;
144
    return true;
145
}
145
}
146
 
146
 
147
/** @}
147
/** @}
148
 */
148
 */
149
 
149