source: mainline/uspace/srv/bd/rd/rd.c@ c4eeb2f

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since c4eeb2f was 47b7006, checked in by Martin Decky <martin@…>, 15 years ago

improve run-time termination

  • get rid of exit()
  • get rid of _exit(), use the common exit()
  • get rid of core(), use the common abort()
  • make main() more fail-safe (call abort() on unhealthy conditions), call async_sess_init() explicitly
  • add several libc-private headers for cleaner environment
  • use SYS_TASK_EXIT in exit() and abort()
  • Property mode set to 100644
File size: 6.8 KB
Line 
1/*
2 * Copyright (c) 2007 Michal Konopa
3 * Copyright (c) 2007 Martin Jelen
4 * Copyright (c) 2007 Peter Majer
5 * Copyright (c) 2007 Jakub Jermar
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 *
12 * - Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * - Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * - The name of the author may not be used to endorse or promote products
18 * derived from this software without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
21 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
22 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
23 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
24 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
29 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 */
31
32/** @addtogroup rd
33 * @{
34 */
35
36/**
37 * @file rd.c
38 * @brief Initial RAM disk for HelenOS.
39 */
40
41#include <ipc/services.h>
42#include <ipc/ns.h>
43#include <sysinfo.h>
44#include <as.h>
45#include <ddi.h>
46#include <align.h>
47#include <bool.h>
48#include <errno.h>
49#include <async.h>
50#include <align.h>
51#include <async.h>
52#include <fibril_synch.h>
53#include <stdio.h>
54#include <devmap.h>
55#include <ipc/bd.h>
56#include <macros.h>
57
58#define NAME "rd"
59
60/** Pointer to the ramdisk's image */
61static void *rd_addr;
62
63/** Size of the ramdisk */
64static size_t rd_size;
65
66/** Block size */
67static const size_t block_size = 512;
68
69static int rd_read_blocks(uint64_t ba, size_t cnt, void *buf);
70static int rd_write_blocks(uint64_t ba, size_t cnt, const void *buf);
71
72/** This rwlock protects the ramdisk's data.
73 *
74 * If we were to serve multiple requests (read + write or several writes)
75 * concurrently (i.e. from two or more threads), each read and write needs to
76 * be protected by this rwlock.
77 *
78 */
79fibril_rwlock_t rd_lock;
80
81/** Handle one connection to ramdisk.
82 *
83 * @param iid Hash of the request that opened the connection.
84 * @param icall Call data of the request that opened the connection.
85 */
86static void rd_connection(ipc_callid_t iid, ipc_call_t *icall)
87{
88 ipc_callid_t callid;
89 ipc_call_t call;
90 int retval;
91 void *fs_va = NULL;
92 uint64_t ba;
93 size_t cnt;
94 size_t comm_size;
95
96 /*
97 * Answer the first IPC_M_CONNECT_ME_TO call.
98 */
99 async_answer_0(iid, EOK);
100
101 /*
102 * Now we wait for the client to send us its communication as_area.
103 */
104 unsigned int flags;
105 if (async_share_out_receive(&callid, &comm_size, &flags)) {
106 fs_va = as_get_mappable_page(comm_size);
107 if (fs_va) {
108 (void) async_share_out_finalize(callid, fs_va);
109 } else {
110 async_answer_0(callid, EHANGUP);
111 return;
112 }
113 } else {
114 /*
115 * The client doesn't speak the same protocol.
116 * At this point we can't handle protocol variations.
117 * Close the connection.
118 */
119 async_answer_0(callid, EHANGUP);
120 return;
121 }
122
123 while (true) {
124 callid = async_get_call(&call);
125 switch (IPC_GET_IMETHOD(call)) {
126 case IPC_M_PHONE_HUNGUP:
127 /*
128 * The other side has hung up.
129 * Answer the message and exit the fibril.
130 */
131 async_answer_0(callid, EOK);
132 return;
133 case BD_READ_BLOCKS:
134 ba = MERGE_LOUP32(IPC_GET_ARG1(call),
135 IPC_GET_ARG2(call));
136 cnt = IPC_GET_ARG3(call);
137 if (cnt * block_size > comm_size) {
138 retval = ELIMIT;
139 break;
140 }
141 retval = rd_read_blocks(ba, cnt, fs_va);
142 break;
143 case BD_WRITE_BLOCKS:
144 ba = MERGE_LOUP32(IPC_GET_ARG1(call),
145 IPC_GET_ARG2(call));
146 cnt = IPC_GET_ARG3(call);
147 if (cnt * block_size > comm_size) {
148 retval = ELIMIT;
149 break;
150 }
151 retval = rd_write_blocks(ba, cnt, fs_va);
152 break;
153 case BD_GET_BLOCK_SIZE:
154 async_answer_1(callid, EOK, block_size);
155 continue;
156 case BD_GET_NUM_BLOCKS:
157 async_answer_2(callid, EOK, LOWER32(rd_size / block_size),
158 UPPER32(rd_size / block_size));
159 continue;
160 default:
161 /*
162 * The client doesn't speak the same protocol.
163 * Instead of closing the connection, we just ignore
164 * the call. This can be useful if the client uses a
165 * newer version of the protocol.
166 */
167 retval = EINVAL;
168 break;
169 }
170 async_answer_0(callid, retval);
171 }
172}
173
174/** Read blocks from the device. */
175static int rd_read_blocks(uint64_t ba, size_t cnt, void *buf)
176{
177 if ((ba + cnt) * block_size > rd_size) {
178 /* Reading past the end of the device. */
179 return ELIMIT;
180 }
181
182 fibril_rwlock_read_lock(&rd_lock);
183 memcpy(buf, rd_addr + ba * block_size, block_size * cnt);
184 fibril_rwlock_read_unlock(&rd_lock);
185
186 return EOK;
187}
188
189/** Write blocks to the device. */
190static int rd_write_blocks(uint64_t ba, size_t cnt, const void *buf)
191{
192 if ((ba + cnt) * block_size > rd_size) {
193 /* Writing past the end of the device. */
194 return ELIMIT;
195 }
196
197 fibril_rwlock_write_lock(&rd_lock);
198 memcpy(rd_addr + ba * block_size, buf, block_size * cnt);
199 fibril_rwlock_write_unlock(&rd_lock);
200
201 return EOK;
202}
203
204/** Prepare the ramdisk image for operation. */
205static bool rd_init(void)
206{
207 int ret = sysinfo_get_value("rd.size", &rd_size);
208 if ((ret != EOK) || (rd_size == 0)) {
209 printf("%s: No RAM disk found\n", NAME);
210 return false;
211 }
212
213 sysarg_t rd_ph_addr;
214 ret = sysinfo_get_value("rd.address.physical", &rd_ph_addr);
215 if ((ret != EOK) || (rd_ph_addr == 0)) {
216 printf("%s: Invalid RAM disk physical address\n", NAME);
217 return false;
218 }
219
220 rd_addr = as_get_mappable_page(rd_size);
221
222 int flags = AS_AREA_READ | AS_AREA_WRITE | AS_AREA_CACHEABLE;
223 int retval = physmem_map((void *) rd_ph_addr, rd_addr,
224 ALIGN_UP(rd_size, PAGE_SIZE) >> PAGE_WIDTH, flags);
225
226 if (retval < 0) {
227 printf("%s: Error mapping RAM disk\n", NAME);
228 return false;
229 }
230
231 printf("%s: Found RAM disk at %p, %zu bytes\n", NAME,
232 (void *) rd_ph_addr, rd_size);
233
234 int rc = devmap_driver_register(NAME, rd_connection);
235 if (rc < 0) {
236 printf("%s: Unable to register driver (%d)\n", NAME, rc);
237 return false;
238 }
239
240 devmap_handle_t devmap_handle;
241 if (devmap_device_register("bd/initrd", &devmap_handle) != EOK) {
242 printf("%s: Unable to register device\n", NAME);
243 return false;
244 }
245
246 fibril_rwlock_initialize(&rd_lock);
247
248 return true;
249}
250
251int main(int argc, char **argv)
252{
253 printf("%s: HelenOS RAM disk server\n", NAME);
254
255 if (!rd_init())
256 return -1;
257
258 printf("%s: Accepting connections\n", NAME);
259 async_manager();
260
261 /* Never reached */
262 return 0;
263}
264
265/**
266 * @}
267 */
Note: See TracBrowser for help on using the repository browser.