Rev 3655 | Rev 4220 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 3655 | Rev 3790 | ||
---|---|---|---|
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 |
52 | bool |
53 | ofw_pci_apply_ranges(ofw_tree_node_t *node, ofw_pci_reg_t *reg, uintptr_t *pa) |
53 | ofw_pci_apply_ranges(ofw_tree_node_t *node, ofw_pci_reg_t *reg, uintptr_t *pa) |
54 | { |
54 | { |
55 | ofw_tree_property_t *prop; |
55 | ofw_tree_property_t *prop; |
56 | ofw_pci_range_t *range; |
56 | ofw_pci_range_t *range; |
57 | count_t ranges; |
57 | count_t ranges; |
58 | 58 | ||
59 | prop = ofw_tree_getprop(node, "ranges"); |
59 | prop = ofw_tree_getprop(node, "ranges"); |
60 | if (!prop) { |
60 | if (!prop) { |
61 | if (strcmp(ofw_tree_node_name(node->parent), "pci") == 0) |
61 | if (strcmp(ofw_tree_node_name(node->parent), "pci") == 0) |
62 | return ofw_pci_apply_ranges(node->parent, reg, pa); |
62 | return ofw_pci_apply_ranges(node->parent, reg, pa); |
63 | return false; |
63 | return false; |
64 | } |
64 | } |
65 | 65 | ||
66 | ranges = prop->size / sizeof(ofw_pci_range_t); |
66 | ranges = prop->size / sizeof(ofw_pci_range_t); |
67 | range = prop->value; |
67 | range = prop->value; |
68 | 68 | ||
69 | unsigned int i; |
69 | unsigned int i; |
70 | 70 | ||
71 | for (i = 0; i < ranges; i++) { |
71 | for (i = 0; i < ranges; i++) { |
72 | if ((reg->space & PCI_SPACE_MASK) != |
72 | if ((reg->space & PCI_SPACE_MASK) != |
73 | (range[i].space & PCI_SPACE_MASK)) |
73 | (range[i].space & PCI_SPACE_MASK)) |
74 | continue; |
74 | continue; |
75 | if (overlaps(reg->addr, reg->size, range[i].child_base, |
75 | if (overlaps(reg->addr, reg->size, range[i].child_base, |
76 | range[i].size)) { |
76 | range[i].size)) { |
77 | *pa = range[i].parent_base + |
77 | *pa = range[i].parent_base + |
78 | (reg->addr - range[i].child_base); |
78 | (reg->addr - range[i].child_base); |
79 | return true; |
79 | return true; |
80 | } |
80 | } |
81 | } |
81 | } |
82 | 82 | ||
83 | return false; |
83 | return false; |
84 | } |
84 | } |
85 | 85 | ||
86 | bool |
86 | bool |
87 | ofw_pci_reg_absolutize(ofw_tree_node_t *node, ofw_pci_reg_t *reg, |
87 | ofw_pci_reg_absolutize(ofw_tree_node_t *node, ofw_pci_reg_t *reg, |
88 | ofw_pci_reg_t *out) |
88 | ofw_pci_reg_t *out) |
89 | { |
89 | { |
90 | if (reg->space & PCI_ABS_MASK) { |
90 | if (reg->space & PCI_ABS_MASK) { |
91 | /* already absolute */ |
91 | /* already absolute */ |
92 | out->space = reg->space; |
92 | out->space = reg->space; |
93 | out->addr = reg->addr; |
93 | out->addr = reg->addr; |
94 | out->size = reg->size; |
94 | out->size = reg->size; |
95 | return true; |
95 | return true; |
96 | } |
96 | } |
97 | 97 | ||
98 | ofw_tree_property_t *prop; |
98 | ofw_tree_property_t *prop; |
99 | ofw_pci_reg_t *assigned_address; |
99 | ofw_pci_reg_t *assigned_address; |
100 | count_t assigned_addresses; |
100 | count_t assigned_addresses; |
101 | 101 | ||
102 | prop = ofw_tree_getprop(node, "assigned-addresses"); |
102 | prop = ofw_tree_getprop(node, "assigned-addresses"); |
103 | if (!prop) |
103 | if (!prop) |
104 | panic("Can't find \"assigned-addresses\" property.\n"); |
104 | panic("Cannot find 'assigned-addresses' property."); |
105 | 105 | ||
106 | assigned_addresses = prop->size / sizeof(ofw_pci_reg_t); |
106 | assigned_addresses = prop->size / sizeof(ofw_pci_reg_t); |
107 | assigned_address = prop->value; |
107 | assigned_address = prop->value; |
108 | 108 | ||
109 | unsigned int i; |
109 | unsigned int i; |
110 | 110 | ||
111 | for (i = 0; i < assigned_addresses; i++) { |
111 | for (i = 0; i < assigned_addresses; i++) { |
112 | if ((assigned_address[i].space & PCI_REG_MASK) == |
112 | if ((assigned_address[i].space & PCI_REG_MASK) == |
113 | (reg->space & PCI_REG_MASK)) { |
113 | (reg->space & PCI_REG_MASK)) { |
114 | out->space = assigned_address[i].space; |
114 | out->space = assigned_address[i].space; |
115 | out->addr = reg->addr + assigned_address[i].addr; |
115 | out->addr = reg->addr + assigned_address[i].addr; |
116 | out->size = reg->size; |
116 | out->size = reg->size; |
117 | return true; |
117 | return true; |
118 | } |
118 | } |
119 | } |
119 | } |
120 | 120 | ||
121 | return false; |
121 | return false; |
122 | } |
122 | } |
123 | 123 | ||
124 | /** Map PCI interrupt. |
124 | /** Map PCI interrupt. |
125 | * |
125 | * |
126 | * So far, we only know how to map interrupts of non-PCI devices connected |
126 | * So far, we only know how to map interrupts of non-PCI devices connected |
127 | * to a PCI bridge. |
127 | * to a PCI bridge. |
128 | */ |
128 | */ |
129 | bool |
129 | bool |
130 | ofw_pci_map_interrupt(ofw_tree_node_t *node, ofw_pci_reg_t *reg, int ino, |
130 | ofw_pci_map_interrupt(ofw_tree_node_t *node, ofw_pci_reg_t *reg, int ino, |
131 | int *inr, cir_t *cir, void **cir_arg) |
131 | int *inr, cir_t *cir, void **cir_arg) |
132 | { |
132 | { |
133 | pci_t *pci = node->device; |
133 | pci_t *pci = node->device; |
134 | if (!pci) { |
134 | if (!pci) { |
135 | pci = pci_init(node); |
135 | pci = pci_init(node); |
136 | if (!pci) |
136 | if (!pci) |
137 | return false; |
137 | return false; |
138 | node->device = pci; |
138 | node->device = pci; |
139 | } |
139 | } |
140 | 140 | ||
141 | pci_enable_interrupt(pci, ino); |
141 | pci_enable_interrupt(pci, ino); |
142 | 142 | ||
143 | *inr = (PCI_IGN << IGN_SHIFT) | ino; |
143 | *inr = (PCI_IGN << IGN_SHIFT) | ino; |
144 | *cir = pci_clear_interrupt; |
144 | *cir = pci_clear_interrupt; |
145 | *cir_arg = pci; |
145 | *cir_arg = pci; |
146 | 146 | ||
147 | return true; |
147 | return true; |
148 | } |
148 | } |
149 | 149 | ||
150 | /** @} |
150 | /** @} |
151 | */ |
151 | */ |
152 | 152 |