Subversion Repositories HelenOS

Rev

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

Rev 1912 Rev 2071
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   PCI 'reg' and 'ranges' properties handling.
34
 * @brief   PCI '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/pci.h>
39
#include <arch/drivers/pci.h>
40
#include <arch/trap/interrupt.h>
40
#include <arch/trap/interrupt.h>
41
#include <arch/memstr.h>
41
#include <arch/memstr.h>
42
#include <func.h>
42
#include <func.h>
43
#include <panic.h>
43
#include <panic.h>
44
#include <macros.h>
44
#include <macros.h>
45
 
45
 
46
#define PCI_SPACE_MASK      0x03000000
46
#define PCI_SPACE_MASK      0x03000000
47
#define PCI_ABS_MASK        0x80000000  
47
#define PCI_ABS_MASK        0x80000000  
48
#define PCI_REG_MASK        0x000000ff
48
#define PCI_REG_MASK        0x000000ff
49
 
49
 
50
#define PCI_IGN         0x1f
50
#define PCI_IGN         0x1f
51
 
51
 
52
bool ofw_pci_apply_ranges(ofw_tree_node_t *node, ofw_pci_reg_t *reg, uintptr_t *pa)
52
bool ofw_pci_apply_ranges(ofw_tree_node_t *node, ofw_pci_reg_t *reg, uintptr_t *pa)
53
{
53
{
54
    ofw_tree_property_t *prop;
54
    ofw_tree_property_t *prop;
55
    ofw_pci_range_t *range;
55
    ofw_pci_range_t *range;
56
    count_t ranges;
56
    count_t ranges;
57
 
57
 
58
    prop = ofw_tree_getprop(node, "ranges");
58
    prop = ofw_tree_getprop(node, "ranges");
59
    if (!prop) {
59
    if (!prop) {
60
        if (strcmp(ofw_tree_node_name(node->parent), "pci") == 0)
60
        if (strcmp(ofw_tree_node_name(node->parent), "pci") == 0)
61
            return ofw_pci_apply_ranges(node->parent, reg, pa);
61
            return ofw_pci_apply_ranges(node->parent, reg, pa);
62
        return false;
62
        return false;
63
    }
63
    }
64
       
64
       
65
    ranges = prop->size / sizeof(ofw_pci_range_t);
65
    ranges = prop->size / sizeof(ofw_pci_range_t);
66
    range = prop->value;
66
    range = prop->value;
67
   
67
   
68
    int i;
68
    int i;
69
   
69
   
70
    for (i = 0; i < ranges; i++) {
70
    for (i = 0; i < ranges; i++) {
71
        if ((reg->space & PCI_SPACE_MASK) != (range[i].space & PCI_SPACE_MASK))
71
        if ((reg->space & PCI_SPACE_MASK) != (range[i].space & PCI_SPACE_MASK))
72
            continue;
72
            continue;
73
        if (overlaps(reg->addr, reg->size, range[i].child_base, range[i].size)) {
73
        if (overlaps(reg->addr, reg->size, range[i].child_base, range[i].size)) {
74
            *pa = range[i].parent_base + (reg->addr - range[i].child_base);
74
            *pa = range[i].parent_base + (reg->addr - range[i].child_base);
75
            return true;
75
            return true;
76
        }
76
        }
77
    }
77
    }
78
 
78
 
79
    return false;
79
    return false;
80
}
80
}
81
 
81
 
82
bool ofw_pci_reg_absolutize(ofw_tree_node_t *node, ofw_pci_reg_t *reg, ofw_pci_reg_t *out)
82
bool ofw_pci_reg_absolutize(ofw_tree_node_t *node, ofw_pci_reg_t *reg, ofw_pci_reg_t *out)
83
{
83
{
84
    if (reg->space & PCI_ABS_MASK) {
84
    if (reg->space & PCI_ABS_MASK) {
85
        /* already absolute */
85
        /* already absolute */
86
        out->space = reg->space;
86
        out->space = reg->space;
87
        out->addr = reg->addr;
87
        out->addr = reg->addr;
88
        out->size = reg->size;
88
        out->size = reg->size;
89
        return true;
89
        return true;
90
    }
90
    }
91
   
91
   
92
    ofw_tree_property_t *prop;
92
    ofw_tree_property_t *prop;
93
    ofw_pci_reg_t *assigned_address;
93
    ofw_pci_reg_t *assigned_address;
94
    count_t assigned_addresses;
94
    count_t assigned_addresses;
95
   
95
   
96
    prop = ofw_tree_getprop(node, "assigned-addresses");
96
    prop = ofw_tree_getprop(node, "assigned-addresses");
97
    if (!prop)
97
    if (!prop)
98
        panic("Can't find \"assigned-addresses\" property.\n");
98
        panic("Can't find \"assigned-addresses\" property.\n");
99
   
99
   
100
    assigned_addresses = prop->size / sizeof(ofw_pci_reg_t);
100
    assigned_addresses = prop->size / sizeof(ofw_pci_reg_t);
101
    assigned_address = prop->value;
101
    assigned_address = prop->value;
102
   
102
   
103
    int i;
103
    int i;
104
   
104
   
105
    for (i = 0; i < assigned_addresses; i++) {
105
    for (i = 0; i < assigned_addresses; i++) {
106
        if ((assigned_address[i].space & PCI_REG_MASK) == (reg->space & PCI_REG_MASK)) {
106
        if ((assigned_address[i].space & PCI_REG_MASK) == (reg->space & PCI_REG_MASK)) {
107
            out->space = assigned_address[i].space;
107
            out->space = assigned_address[i].space;
108
            out->addr = reg->addr + assigned_address[i].addr;
108
            out->addr = reg->addr + assigned_address[i].addr;
109
            out->size = reg->size;
109
            out->size = reg->size;
110
            return true;
110
            return true;
111
        }
111
        }
112
    }
112
    }
113
   
113
   
114
    return false;
114
    return false;
115
}
115
}
116
 
116
 
117
/** Map PCI interrupt.
117
/** Map PCI interrupt.
118
 *
118
 *
119
 * So far, we only know how to map interrupts of non-PCI devices connected
119
 * So far, we only know how to map interrupts of non-PCI devices connected
120
 * to a PCI bridge.
120
 * to a PCI bridge.
121
 */
121
 */
122
bool ofw_pci_map_interrupt(ofw_tree_node_t *node, ofw_pci_reg_t *reg, int ino, int *inr)
122
bool ofw_pci_map_interrupt(ofw_tree_node_t *node, ofw_pci_reg_t *reg, int ino, int *inr)
123
{
123
{
124
    pci_t *pci = node->device;
124
    pci_t *pci = node->device;
125
    if (!pci) {
125
    if (!pci) {
126
        pci = pci_init(node);
126
        pci = pci_init(node);
127
        if (!pci)
127
        if (!pci)
128
            return false;
128
            return false;
129
        node->device = pci;
129
        node->device = pci;
130
    }
130
    }
131
 
131
 
132
    pci_enable_interrupt(pci, ino);
132
    pci_enable_interrupt(pci, ino);
133
 
133
 
134
    *inr = (PCI_IGN << IGN_SHIFT) | ino;
134
    *inr = (PCI_IGN << IGN_SHIFT) | ino;
135
 
135
 
136
    return true;
136
    return true;
137
}
137
}
138
 
138
 
139
/** @}
139
/** @}
140
 */
140
 */
141
 
141