1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
|
/* $OpenBSD: rbus.h,v 1.1 2000/04/08 05:50:53 aaron Exp $ */
/* $NetBSD: rbus.h,v 1.3 1999/12/15 12:28:55 kleink Exp $ */
/*
* Copyright (c) 1999
* HAYAKAWA Koichi. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the author.
* 4. 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.
*/
#ifndef _DEV_CARDBUS_RBUS_H_
#define _DEV_CARDBUS_RBUS_H_
/*
* This file defines rbus (pseudo) class
*
* What is rbus?
*
* Ths rbus is a recursive bus-space administrator. This means a
* parent bus-space administrator, which usually belongs to a bus
* bridge, makes some child bus-space administorators and gives
* (restricted) bus-space for children. There are a root bus-space
* administrator which maintains whole bus-space.
*
* Why recursive?
*
* The recursive bus-space administration has two virtues. The
* former is this modelling matches the actual memory and io space
* management of bridge devices well. The latter is the rbus is
* distributed management system, so it matches well with
* multi-thread kernel.
*
* Abstraction
*
* The rbus models bus-to-bus bridge into three way: dedicate, share
* and slave. Dedicate means that the bridge has dedicate bus space.
* Share means that the bridge has bus space, but this bus space is
* shared with other bus bridges. Slave means the bus bridge which
* does not have it own bus space and ask a parent bus bridge for bus
* space when a client requests bus space to the bridge.
*/
/* require sys/extent.h */
/* require machine/bus.h */
#define rbus 1
struct extent;
/*
* General rule
*
* 1) When a rbustag has no space for child (it means rb_extent is
* NULL), ask bus-space for parent through rb_parent.
*
* 2) When a rbustag has its own space (whether shared or dedicated),
* allocate from rb_ext.
*/
struct rbustag {
bus_space_tag_t rb_bt;
struct rbustag *rb_parent;
struct extent *rb_ext;
bus_addr_t rb_start;
bus_addr_t rb_end;
bus_addr_t rb_offset;
#if notyet
int (*rb_space_alloc) __P((struct rbustag *,
bus_addr_t start, bus_addr_t end,
bus_addr_t addr, bus_size_t size,
bus_addr_t mask, bus_addr_t align,
int flags,
bus_addr_t *addrp, bus_space_handle_t *bshp));
int (*rbus_space_free) __P((struct rbustag *, bus_space_handle_t,
bus_size_t size, bus_addr_t *addrp));
#endif
int rb_flags;
#define RBUS_SPACE_INVALID 0x00
#define RBUS_SPACE_SHARE 0x01
#define RBUS_SPACE_DEDICATE 0x02
#define RBUS_SPACE_MASK 0x03
#define RBUS_SPACE_ASK_PARENT 0x04
/* your own data below */
void *rb_md;
};
typedef struct rbustag *rbus_tag_t;
/*
* These functions sugarcoat rbus interface to make rbus being used
* easier. These functions should be member functions of rbus
* `class'.
*/
int rbus_space_alloc __P((rbus_tag_t,
bus_addr_t addr, bus_size_t size, bus_addr_t mask,
bus_addr_t align, int flags,
bus_addr_t *addrp, bus_space_handle_t *bshp));
int rbus_space_alloc_subregion __P((rbus_tag_t,
bus_addr_t start, bus_addr_t end,
bus_addr_t addr, bus_size_t size,
bus_addr_t mask, bus_addr_t align,
int flags,
bus_addr_t *addrp, bus_space_handle_t *bshp));
int rbus_space_free __P((rbus_tag_t, bus_space_handle_t, bus_size_t size,
bus_addr_t *addrp));
/*
* These functions create rbus instance. These functions are
* so-called-as a constructor of rbus.
*
* rbus_new is a constructor which make an rbus instance from a parent
* rbus.
*/
rbus_tag_t rbus_new __P((rbus_tag_t parent, bus_addr_t start, bus_size_t size,
bus_addr_t offset, int flags));
rbus_tag_t rbus_new_root_delegate __P((bus_space_tag_t, bus_addr_t, bus_size_t,
bus_addr_t offset));
rbus_tag_t rbus_new_root_share __P((bus_space_tag_t, struct extent *,
bus_addr_t, bus_size_t,bus_addr_t offset));
/*
* This function release bus-space used by the argument. This
* function is so-called-as a destructor.
*/
int rbus_delete __P((rbus_tag_t));
/*
* Machine-dependent definitions.
*/
#include <machine/rbus_machdep.h>
#endif /* !_DEV_CARDBUS_RBUS_H_ */
|
