Subversion Repositories HelenOS

Rev

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

Rev 1896 Rev 1897
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/memstr.h>
39
#include <arch/memstr.h>
40
#include <func.h>
40
#include <func.h>
41
#include <panic.h>
41
#include <panic.h>
42
#include <macros.h>
42
#include <macros.h>
43
 
43
 
44
#define PCI_SPACE_MASK  0x03000000
44
#define PCI_SPACE_MASK      0x03000000
-
 
45
#define PCI_ABS_MASK        0x80000000  
-
 
46
#define PCI_REG_MASK        0x000000ff
45
 
47
 
46
bool ofw_pci_apply_ranges(ofw_tree_node_t *node, ofw_pci_reg_t *reg, uintptr_t *pa)
48
bool ofw_pci_apply_ranges(ofw_tree_node_t *node, ofw_pci_reg_t *reg, uintptr_t *pa)
47
{
49
{
48
    ofw_tree_property_t *prop;
50
    ofw_tree_property_t *prop;
49
    ofw_pci_range_t *range;
51
    ofw_pci_range_t *range;
50
    count_t ranges;
52
    count_t ranges;
51
 
53
 
52
    prop = ofw_tree_getprop(node, "ranges");
54
    prop = ofw_tree_getprop(node, "ranges");
53
    if (!prop) {
55
    if (!prop) {
54
        if (strcmp(ofw_tree_node_name(node->parent), "pci") == 0)
56
        if (strcmp(ofw_tree_node_name(node->parent), "pci") == 0)
55
            return ofw_pci_apply_ranges(node->parent, reg, pa);
57
            return ofw_pci_apply_ranges(node->parent, reg, pa);
56
        return false;
58
        return false;
57
    }
59
    }
58
       
60
       
59
    ranges = prop->size / sizeof(ofw_pci_range_t);
61
    ranges = prop->size / sizeof(ofw_pci_range_t);
60
    range = prop->value;
62
    range = prop->value;
61
   
63
   
62
    int i;
64
    int i;
63
   
65
   
64
    for (i = 0; i < ranges; i++) {
66
    for (i = 0; i < ranges; i++) {
65
        if ((reg->space & PCI_SPACE_MASK) != (range[i].space & PCI_SPACE_MASK))
67
        if ((reg->space & PCI_SPACE_MASK) != (range[i].space & PCI_SPACE_MASK))
66
            continue;
68
            continue;
67
        if (overlaps(reg->addr, reg->size, range[i].child_base, range[i].size)) {
69
        if (overlaps(reg->addr, reg->size, range[i].child_base, range[i].size)) {
68
            *pa = range[i].parent_base + (reg->addr - range[i].child_base);
70
            *pa = range[i].parent_base + (reg->addr - range[i].child_base);
69
            return true;
71
            return true;
70
        }
72
        }
71
    }
73
    }
72
 
74
 
73
    return false;
75
    return false;
-
 
76
}
-
 
77
 
-
 
78
bool ofw_pci_reg_absolutize(ofw_tree_node_t *node, ofw_pci_reg_t *reg, ofw_pci_reg_t *out)
-
 
79
{
-
 
80
    if (reg->space & PCI_ABS_MASK) {
-
 
81
        /* already absolute */
-
 
82
        out->space = reg->space;
-
 
83
        out->addr = reg->addr;
-
 
84
        out->size = reg->size;
-
 
85
        return true;
-
 
86
    }
-
 
87
   
-
 
88
    ofw_tree_property_t *prop;
-
 
89
    ofw_pci_reg_t *assigned_address;
-
 
90
    count_t assigned_addresses;
-
 
91
   
-
 
92
    prop = ofw_tree_getprop(node, "assigned-addresses");
-
 
93
    if (!prop)
-
 
94
        panic("Can't find \"assigned-addresses\" property.\n");
-
 
95
   
-
 
96
    assigned_addresses = prop->size / sizeof(ofw_pci_reg_t);
-
 
97
    assigned_address = prop->value;
-
 
98
   
-
 
99
    int i;
-
 
100
   
-
 
101
    for (i = 0; i < assigned_addresses; i++) {
-
 
102
        if ((assigned_address[i].space & PCI_REG_MASK) == (reg->space & PCI_REG_MASK)) {
-
 
103
            out->space = assigned_address[i].space;
-
 
104
            out->addr = reg->addr + assigned_address[i].addr;
-
 
105
            out->size = reg->size;
-
 
106
            return true;
-
 
107
        }
-
 
108
    }
-
 
109
   
-
 
110
    return false;
74
}
111
}
75
 
112
 
76
/** @}
113
/** @}
77
 */
114
 */
78
 
115