WebSVN – HelenOS – Diff – /trunk/kernel/genarch/src/ofw/ebus.c


/*
 * Copyright (C) 2006 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
/** @addtogroup ofw
 * @{
 */
/**
 * @file
 * @brief   EBUS 'reg' and 'ranges' properties handling.
 *
 */
 
#include <genarch/ofw/ofw_tree.h>
#include <arch/memstr.h>
#include <func.h>
#include <panic.h>
#include <debug.h>
#include <macros.h>
 
bool ofw_ebus_apply_ranges(ofw_tree_node_t *node, ofw_ebus_reg_t *reg, uintptr_t *pa)
{
    ofw_tree_property_t *prop;
    ofw_ebus_range_t *range;
    count_t ranges;
 
    prop = ofw_tree_getprop(node, "ranges");
    if (!prop)
        return false;
       
    ranges = prop->size / sizeof(ofw_ebus_range_t);
    range = prop->value;
   
    int i;
   
    for (i = 0; i < ranges; i++) {
        if (reg->space != range[i].child_space)
            continue;
        if (overlaps(reg->addr, reg->size, range[i].child_base, range[i].size)) {
            ofw_pci_reg_t pci_reg;
           
            pci_reg.space = range[i].parent_space;
            pci_reg.addr = range[i].parent_base + (reg->addr - range[i].child_base);
            pci_reg.size = reg->size;
           
            return ofw_pci_apply_ranges(node->parent, &pci_reg, pa);
        }
    }
 
    return false;
}
 
bool ofw_ebus_map_interrupts(ofw_tree_node_t *node, ofw_ebus_reg_t *reg, uint32_t interrupt, int *inr)
{
    ofw_tree_property_t *prop;
    ofw_tree_node_t *controller;
   
    prop = ofw_tree_getprop(node, "interrupt-map");
    if (!prop || !prop->value)
        return false;
 
    ofw_ebus_intr_map_t *intr_map = prop->value;
    count_t count = prop->size / sizeof(ofw_ebus_intr_map_t);
   
    ASSERT(count);
   
    prop = ofw_tree_getprop(node, "interrupt-map-mask");
    if (!prop || !prop->value)
        return false;
   
    ofw_ebus_intr_mask_t *intr_mask = prop->value;
   
    ASSERT(prop->size == sizeof(ofw_ebus_intr_mask_t));
   
    uint32_t space = reg->space & intr_mask->space_mask;
    uint32_t addr = reg->addr & intr_mask->addr_mask;
    uint32_t intr = interrupt & intr_mask->intr_mask;
   
    int i;
    for (i = 0; i < count; i++) {
        if ((intr_map[i].space == space) && (intr_map[i].addr == addr)
            && (intr_map[i].intr == intr))
            goto found;
    }
    return false;
 
found:
    /*
     * We found the device that functions as an interrupt controller
     * for the interrupt. We also found mapping from interrupt to INR.
     */
 
    controller = ofw_tree_find_node_by_handle(ofw_tree_lookup("/"), intr_map[i].controller_handle);
   
    *inr = intr_map[i].controller_inr;
    return true;
}
 
/** @}
 */
 

Rev 1909	Rev 1910
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 <func.h>	40	#include <func.h>
41	#include <panic.h>	41	#include <panic.h>
42	#include <debug.h>	42	#include <debug.h>
43	#include <macros.h>	43	#include <macros.h>
44		44
45	bool ofw_ebus_apply_ranges(ofw_tree_node_t node, ofw_ebus_reg_t reg, uintptr_t *pa)	45	bool ofw_ebus_apply_ranges(ofw_tree_node_t node, ofw_ebus_reg_t reg, uintptr_t *pa)
46	{	46	{
47	ofw_tree_property_t *prop;	47	ofw_tree_property_t *prop;
48	ofw_ebus_range_t *range;	48	ofw_ebus_range_t *range;
49	count_t ranges;	49	count_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_ebus_range_t);	55	ranges = prop->size / sizeof(ofw_ebus_range_t);
56	range = prop->value;	56	range = prop->value;
57		57
58	int i;	58	int i;
59		59
60	for (i = 0; i < ranges; i++) {	60	for (i = 0; i < ranges; i++) {
61	if (reg->space != range[i].child_space)	61	if (reg->space != range[i].child_space)
62	continue;	62	continue;
63	if (overlaps(reg->addr, reg->size, range[i].child_base, range[i].size)) {	63	if (overlaps(reg->addr, reg->size, range[i].child_base, range[i].size)) {
64	ofw_pci_reg_t pci_reg;	64	ofw_pci_reg_t pci_reg;
65		65
66	pci_reg.space = range[i].parent_space;	66	pci_reg.space = range[i].parent_space;
67	pci_reg.addr = range[i].parent_base + (reg->addr - range[i].child_base);	67	pci_reg.addr = range[i].parent_base + (reg->addr - range[i].child_base);
68	pci_reg.size = reg->size;	68	pci_reg.size = reg->size;
69		69
70	return ofw_pci_apply_ranges(node->parent, &pci_reg, pa);	70	return ofw_pci_apply_ranges(node->parent, &pci_reg, pa);
71	}	71	}
72	}	72	}
73		73
74	return false;	74	return false;
75	}	75	}
76		76
77	bool ofw_ebus_map_interrupts(ofw_tree_node_t node, ofw_ebus_reg_t reg, uint32_t interrupt, int *ino)	77	bool ofw_ebus_map_interrupts(ofw_tree_node_t node, ofw_ebus_reg_t reg, uint32_t interrupt, int *inr)
78	{	78	{
79	ofw_tree_property_t *prop;	79	ofw_tree_property_t *prop;
80	ofw_tree_node_t *controller;	80	ofw_tree_node_t *controller;
81		81
82	prop = ofw_tree_getprop(node, "interrupt-map");	82	prop = ofw_tree_getprop(node, "interrupt-map");
83	if (!prop \|\| !prop->value)	83	if (!prop \|\| !prop->value)
84	return false;	84	return false;
85		85
86	ofw_ebus_intr_map_t *intr_map = prop->value;	86	ofw_ebus_intr_map_t *intr_map = prop->value;
87	count_t count = prop->size / sizeof(ofw_ebus_intr_map_t);	87	count_t count = prop->size / sizeof(ofw_ebus_intr_map_t);
88		88
89	ASSERT(count);	89	ASSERT(count);
90		90
91	prop = ofw_tree_getprop(node, "interrupt-map-mask");	91	prop = ofw_tree_getprop(node, "interrupt-map-mask");
92	if (!prop \|\| !prop->value)	92	if (!prop \|\| !prop->value)
93	return false;	93	return false;
94		94
95	ofw_ebus_intr_mask_t *intr_mask = prop->value;	95	ofw_ebus_intr_mask_t *intr_mask = prop->value;
96		96
97	ASSERT(prop->size == sizeof(ofw_ebus_intr_mask_t));	97	ASSERT(prop->size == sizeof(ofw_ebus_intr_mask_t));
98		98
99	uint32_t space = reg->space & intr_mask->space_mask;	99	uint32_t space = reg->space & intr_mask->space_mask;
100	uint32_t addr = reg->addr & intr_mask->addr_mask;	100	uint32_t addr = reg->addr & intr_mask->addr_mask;
101	uint32_t intr = interrupt & intr_mask->intr_mask;	101	uint32_t intr = interrupt & intr_mask->intr_mask;
102		102
103	int i;	103	int i;
104	for (i = 0; i < count; i++) {	104	for (i = 0; i < count; i++) {
105	if ((intr_map[i].space == space) && (intr_map[i].addr == addr)	105	if ((intr_map[i].space == space) && (intr_map[i].addr == addr)
106	&& (intr_map[i].intr == intr))	106	&& (intr_map[i].intr == intr))
107	goto found;	107	goto found;
108	}	108	}
109	return false;	109	return false;
110		110
111	found:	111	found:
112	/*	112	/*
113	* We found the device that functions as an interrupt controller	113	* We found the device that functions as an interrupt controller
114	* for the interrupt. We also found mapping from interrupt to INO.	114	* for the interrupt. We also found mapping from interrupt to INR.
115	*/	115	*/
116		116
117	controller = ofw_tree_find_node_by_handle(ofw_tree_lookup("/"), intr_map[i].controller_handle);	117	controller = ofw_tree_find_node_by_handle(ofw_tree_lookup("/"), intr_map[i].controller_handle);
118		118
119	*ino = intr_map[i].controller_ino;	119	*inr = intr_map[i].controller_inr;
120	return true;	120	return true;
121	}	121	}
122		122
123	/** @}	123	/** @}
124	*/	124	*/
125		125

Subversion Repositories HelenOS

(root)/trunk/kernel/genarch/src/ofw/ebus.c @ 1909 – Rev 1909 → 1910