Subversion Repositories HelenOS

Rev

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

Rev 1999 Rev 2005
1
/*
1
/*
2
 * Copyright (C) 2006 Martin Decky
2
 * Copyright (C) 2006 Martin Decky
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 rd
29
/** @addtogroup rd
30
 * @{
30
 * @{
31
 */
31
 */
32
 
32
 
33
/**
33
/**
34
 * @file    rd.c
34
 * @file    rd.c
35
 * @brief   Initial RAM disk for HelenOS.
35
 * @brief   Initial RAM disk for HelenOS.
36
 */
36
 */
37
 
37
 
38
#include <ipc/ipc.h>
38
#include <ipc/ipc.h>
39
#include <ipc/services.h>
39
#include <ipc/services.h>
40
#include <ipc/ns.h>
40
#include <ipc/ns.h>
-
 
41
#include <sysinfo.h>
-
 
42
#include <as.h>
-
 
43
#include <ddi.h>
-
 
44
#include <align.h>
-
 
45
#include <bool.h>
41
#include <errno.h>
46
#include <errno.h>
42
#include <async.h>
47
#include <async.h>
43
 
48
 
44
 
49
 
45
static void rd_connection(ipc_callid_t iid, ipc_call_t *icall)
50
static void rd_connection(ipc_callid_t iid, ipc_call_t *icall)
46
{
51
{
47
    ipc_callid_t callid;
52
    ipc_callid_t callid;
48
    ipc_call_t call;
53
    ipc_call_t call;
49
    int retval;
54
    int retval;
50
 
55
 
51
    ipc_answer_fast(iid, 0, 0, 0);
56
    ipc_answer_fast(iid, 0, 0, 0);
52
 
57
 
53
    while (1) {
58
    while (1) {
54
        callid = async_get_call(&call);
59
        callid = async_get_call(&call);
55
        switch (IPC_GET_METHOD(call)) {
60
        switch (IPC_GET_METHOD(call)) {
56
        case IPC_M_PHONE_HUNGUP:
61
        case IPC_M_PHONE_HUNGUP:
57
            ipc_answer_fast(callid, 0,0,0);
62
            ipc_answer_fast(callid, 0,0,0);
58
            return;
63
            return;
59
        default:
64
        default:
60
            retval = EINVAL;
65
            retval = EINVAL;
61
        }
66
        }
62
        ipc_answer_fast(callid, retval, 0, 0);
67
        ipc_answer_fast(callid, retval, 0, 0);
63
    }  
68
    }  
64
}
69
}
65
 
70
 
66
 
71
 
67
int main(int argc, char **argv)
72
static bool rd_init(void)
68
{
73
{
-
 
74
    size_t rd_size = sysinfo_value("rd.size");
-
 
75
    void * rd_ph_addr = (void *) sysinfo_value("rd.address.physical");
-
 
76
   
69
    ipcarg_t phonead;
77
    if (rd_size == 0)
-
 
78
        return false;
70
   
79
   
71
    async_set_client_connection(rd_connection);
80
    void * rd_addr = as_get_mappable_page(rd_size);
72
   
81
   
73
    /* Register service at nameserver */
-
 
74
    if (ipc_connect_to_me(PHONE_NS, SERVICE_RD, 0, &phonead) != 0)
82
    map_physmem(rd_ph_addr, rd_addr, ALIGN_UP(rd_size, PAGE_SIZE) >> PAGE_WIDTH, AS_AREA_READ | AS_AREA_WRITE);
-
 
83
   
75
        return -1;
84
    return true;
-
 
85
}
76
 
86
 
77
    async_manager();
-
 
78
 
87
 
-
 
88
int main(int argc, char **argv)
-
 
89
{
-
 
90
    if (rd_init()) {
-
 
91
        ipcarg_t phonead;
-
 
92
       
-
 
93
        async_set_client_connection(rd_connection);
-
 
94
       
-
 
95
        /* Register service at nameserver */
-
 
96
        if (ipc_connect_to_me(PHONE_NS, SERVICE_RD, 0, &phonead) != 0)
-
 
97
            return -1;
-
 
98
       
-
 
99
        async_manager();
-
 
100
       
79
    /* Never reached */
101
        /* Never reached */
80
    return 0;
102
        return 0;
-
 
103
    }
-
 
104
   
-
 
105
    return -1;
81
}
106
}
82
 
107
 
83
/**
108
/**
84
 * @}
109
 * @}
85
 */
110
 */
86
 
111