Subversion Repositories HelenOS-historic

Rev

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

Rev 1065 Rev 1073
1
/*
1
/*
2
 * Copyright (C) 2005 Martin Decky
2
 * Copyright (C) 2005 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
#include "version.h"
29
#include "version.h"
30
#include <ipc.h>
30
#include <ipc.h>
31
#include <stdio.h>
31
#include <stdio.h>
32
#include <unistd.h>
32
#include <unistd.h>
33
#include <stdlib.h>
33
#include <stdlib.h>
34
#include <ns.h>
34
#include <ns.h>
35
#include <thread.h>
35
#include <thread.h>
36
 
36
 
37
extern void utest(void *arg);
37
extern void utest(void *arg);
38
void utest(void *arg)
38
void utest(void *arg)
39
{
39
{
40
//  printf("Uspace thread created.\n");
40
//  printf("Uspace thread created.\n");
41
    for (;;)
41
    for (;;)
42
        ;
42
        ;
43
}
43
}
44
 
44
 
45
static void test_printf(void)
45
static void test_printf(void)
46
{
46
{
47
    printf("Simple text.\n");
47
    printf("Simple text.\n");
48
    printf("Now insert '%s' string.\n","this");
48
    printf("Now insert '%s' string.\n","this");
49
    printf("We are brave enought to print numbers like %%d = '%d'\n", 0x123456);
49
    printf("Signed formats on uns. numbers: '%d', '%+d', '% d', '%u' (,+, ,u)\n", 321, 321, 321, 321);
-
 
50
    printf("Signed formats on sig. numbers: '%d', '%+d', '% d', '%u' (,+, ,u)\n", -321, -321, -321, -321);
-
 
51
    printf("Signed with different sized: '%hhd', '%hd', '%d', '%ld', %lld;\n", -3, -32, -321, -32101l, -3210123ll);
50
    printf("And now... '%b' byte! '%w' word! '%W' Word! \n", 0x12, 0x1234, 0x1234);
52
    printf("And now... '%hhd' byte! '%hd' word! '%d' int! \n", 11, 11111, 1111111111);
-
 
53
    printf("Different bases: %#hx, %#hu, %#ho and %#hb\n", 123, 123, 123, 123);
-
 
54
    printf("Different bases signed: %#hx, %#hu, %#ho and %#hb\n", -123, -123, -123, -123);
51
    printf("'%Q' Q! Another '%q' q! \n", 0x1234567887654321ll, 0x1234567887654321ll);
55
    printf("'%llX' llX! Another '%llx' llx! \n", 0x1234567887654321ll, 0x1234567887654321ll);
52
    printf("'%Q' with 64bit value and '%p' with 32 bit value. \n", 0x1234567887654321ll, 0x12345678 );
56
    printf("'%llX' with 64bit value and '%x' with 32 bit value. \n", 0x1234567887654321ll, 0x12345678 );
53
    printf("'%Q' 64bit, '%p' 32bit, '%b' 8bit, '%w' 16bit, '%Q' 64bit and '%s' string.\n", 0x1234567887654321ll, 0x12345678, 0x12, 0x1234, 0x1234567887654321ull, "Lovely string" );
57
    printf("'%llx' 64bit, '%x' 32bit, '%hhx' 8bit, '%hx' 16bit, '%llX' 64bit and '%s' string.\n", 0x1234567887654321ll, 0x12345678, 0x12, 0x1234, 0x1234567887654321ull, "Lovely string" );
54
   
58
   
55
    printf("Thats all, folks!\n");
59
    printf("Thats all, folks!\n");
56
}
60
}
57
 
61
 
58
 
62
 
59
extern char _heap;
63
extern char _heap;
60
static void test_mremap(void)
64
static void test_mremap(void)
61
{
65
{
62
    printf("Writing to good memory\n");
66
    printf("Writing to good memory\n");
63
    mremap(&_heap, 120000, 0);
67
    mremap(&_heap, 120000, 0);
64
    printf("%P\n", ((char *)&_heap));
68
    printf("%P\n", ((char *)&_heap));
65
    printf("%P\n", ((char *)&_heap) + 80000);
69
    printf("%P\n", ((char *)&_heap) + 80000);
66
    *(((char *)&_heap) + 80000) = 10;
70
    *(((char *)&_heap) + 80000) = 10;
67
    printf("Making small\n");
71
    printf("Making small\n");
68
    mremap(&_heap, 16000, 0);
72
    mremap(&_heap, 16000, 0);
69
    printf("Failing..\n");
73
    printf("Failing..\n");
70
    *((&_heap) + 80000) = 10;
74
    *((&_heap) + 80000) = 10;
71
 
75
 
72
    printf("memory done\n");
76
    printf("memory done\n");
73
}
77
}
74
/*
78
/*
75
static void test_sbrk(void)
79
static void test_sbrk(void)
76
{
80
{
77
    printf("Writing to good memory\n");
81
    printf("Writing to good memory\n");
78
    printf("Got: %P\n", sbrk(120000));
82
    printf("Got: %P\n", sbrk(120000));
79
    printf("%P\n", ((char *)&_heap));
83
    printf("%P\n", ((char *)&_heap));
80
    printf("%P\n", ((char *)&_heap) + 80000);
84
    printf("%P\n", ((char *)&_heap) + 80000);
81
    *(((char *)&_heap) + 80000) = 10;
85
    *(((char *)&_heap) + 80000) = 10;
82
    printf("Making small, got: %P\n",sbrk(-120000));
86
    printf("Making small, got: %P\n",sbrk(-120000));
83
    printf("Testing access to heap\n");
87
    printf("Testing access to heap\n");
84
    _heap = 10;
88
    _heap = 10;
85
    printf("Failing..\n");
89
    printf("Failing..\n");
86
    *((&_heap) + 80000) = 10;
90
    *((&_heap) + 80000) = 10;
87
 
91
 
88
    printf("memory done\n");
92
    printf("memory done\n");
89
}
93
}
90
*/
94
*/
91
/*
95
/*
92
static void test_malloc(void)
96
static void test_malloc(void)
93
{
97
{
94
    char *data;
98
    char *data;
95
 
99
 
96
    data = malloc(10);
100
    data = malloc(10);
97
    printf("Heap: %P, data: %P\n", &_heap, data);
101
    printf("Heap: %P, data: %P\n", &_heap, data);
98
    data[0] = 'a';
102
    data[0] = 'a';
99
    free(data);
103
    free(data);
100
}
104
}
101
*/
105
*/
102
 
106
 
103
 
107
 
104
static void test_ping(void)
108
static void test_ping(void)
105
{
109
{
106
    ipcarg_t result;
110
    ipcarg_t result;
107
    int retval;
111
    int retval;
108
 
112
 
109
    retval = ipc_call_sync(PHONE_NS, NS_PING, 0xbeef,&result);
113
    retval = ipc_call_sync(PHONE_NS, NS_PING, 0xbeef,&result);
110
    printf("Retval: %d - received: %P\n", retval, result);
114
    printf("Retval: %d - received: %P\n", retval, result);
111
}
115
}
112
 
116
 
113
static void got_answer(void *private, int retval, ipc_data_t *data)
117
static void got_answer(void *private, int retval, ipc_data_t *data)
114
{
118
{
115
    printf("Retval: %d...%s...%X, %X\n", retval, private,
119
    printf("Retval: %d...%s...%zX, %zX\n", retval, private,
116
           IPC_GET_ARG1(*data), IPC_GET_ARG2(*data));
120
           IPC_GET_ARG1(*data), IPC_GET_ARG2(*data));
117
}
121
}
118
static void test_async_ipc(void)
122
static void test_async_ipc(void)
119
{
123
{
120
    ipc_call_t data;
124
    ipc_call_t data;
121
    int i;
125
    int i;
122
 
126
 
123
    printf("Sending ping\n");
127
    printf("Sending ping\n");
124
    ipc_call_async_2(PHONE_NS, NS_PING, 1, 0xbeefbee2,
128
    ipc_call_async_2(PHONE_NS, NS_PING, 1, 0xbeefbee2,
125
             "Pong1", got_answer);
129
             "Pong1", got_answer);
126
    ipc_call_async_2(PHONE_NS, NS_PING, 2, 0xbeefbee4,
130
    ipc_call_async_2(PHONE_NS, NS_PING, 2, 0xbeefbee4,
127
             "Pong2", got_answer);
131
             "Pong2", got_answer);
128
    ipc_call_async_2(PHONE_NS, NS_PING, 3, 0xbeefbee4,
132
    ipc_call_async_2(PHONE_NS, NS_PING, 3, 0xbeefbee4,
129
             "Pong3", got_answer);
133
             "Pong3", got_answer);
130
    ipc_call_async_2(PHONE_NS, NS_PING, 4, 0xbeefbee4,
134
    ipc_call_async_2(PHONE_NS, NS_PING, 4, 0xbeefbee4,
131
             "Pong4", got_answer);
135
             "Pong4", got_answer);
132
    ipc_call_async_2(PHONE_NS, NS_PING, 5, 0xbeefbee4,
136
    ipc_call_async_2(PHONE_NS, NS_PING, 5, 0xbeefbee4,
133
             "Pong5", got_answer);
137
             "Pong5", got_answer);
134
    ipc_call_async_2(PHONE_NS, NS_PING, 6, 0xbeefbee4,
138
    ipc_call_async_2(PHONE_NS, NS_PING, 6, 0xbeefbee4,
135
             "Pong6", got_answer);
139
             "Pong6", got_answer);
136
    printf("Waiting forever...\n");
140
    printf("Waiting forever...\n");
137
    for (i=0; i<100;i++)
141
    for (i=0; i<100;i++)
138
        printf(".");
142
        printf(".");
139
    printf("\n");
143
    printf("\n");
140
    ipc_wait_for_call(&data, NULL);
144
    ipc_wait_for_call(&data, NULL);
141
    printf("Received call???\n");
145
    printf("Received call???\n");
142
}
146
}
143
 
147
 
144
 
148
 
145
static void got_answer_2(void *private, int retval, ipc_data_t *data)
149
static void got_answer_2(void *private, int retval, ipc_data_t *data)
146
{
150
{
147
    printf("Pong\n");
151
    printf("Pong\n");
148
}
152
}
149
static void test_advanced_ipc(void)
153
static void test_advanced_ipc(void)
150
{
154
{
151
    int res;
155
    int res;
152
    unsigned long long taskid;
156
    unsigned long long taskid;
153
    ipc_callid_t callid;
157
    ipc_callid_t callid;
154
    ipc_call_t data;
158
    ipc_call_t data;
155
    int i;
159
    int i;
156
 
160
 
157
    printf("Asking 0 to connect to me...\n");
161
    printf("Asking 0 to connect to me...\n");
158
    res = ipc_connect_to_me(0, 1, 2, &taskid);
162
    res = ipc_connect_to_me(0, 1, 2, &taskid);
159
    printf("Result: %d - taskid: %Q\n", res, taskid);
163
    printf("Result: %d - taskid: %llu\n", res, taskid);
160
    for (i=0; i < 100; i++) {
164
    for (i=0; i < 100; i++) {
161
        printf("----------------\n");
165
        printf("----------------\n");
162
        ipc_call_async(PHONE_NS, NS_PING_SVC, 0, "prov",
166
        ipc_call_async(PHONE_NS, NS_PING_SVC, 0, "prov",
163
                   got_answer_2);
167
                   got_answer_2);
164
        callid = ipc_wait_for_call(&data, NULL);
168
        callid = ipc_wait_for_call(&data, NULL);
165
        printf("Received ping\n");
169
        printf("Received ping\n");
166
        ipc_answer(callid, 0, 0, 0);
170
        ipc_answer(callid, 0, 0, 0);
167
    }
171
    }
168
    callid = ipc_wait_for_call(&data, NULL);
172
    callid = ipc_wait_for_call(&data, NULL);
169
}
173
}
170
 
174
 
171
static void test_connection_ipc(void)
175
static void test_connection_ipc(void)
172
{
176
{
173
    int res;
177
    int res;
174
    ipcarg_t result;
178
    ipcarg_t result;
175
 
179
 
176
    printf("Starting connect...\n");
180
    printf("Starting connect...\n");
177
    res = ipc_connect_me_to(PHONE_NS, 10, 20);
181
    res = ipc_connect_me_to(PHONE_NS, 10, 20);
178
    printf("Connected: %d\n", res);
182
    printf("Connected: %d\n", res);
179
    printf("pinging.\n");
183
    printf("pinging.\n");
180
    res = ipc_call_sync(res, NS_PING, 0xbeef,&result);
184
    res = ipc_call_sync(res, NS_PING, 0xbeef,&result);
181
    printf("Retval: %d - received: %P\n", res, result);
185
    printf("Retval: %d - received: %zd\n", res, result);
182
   
186
   
183
}
187
}
184
 
188
 
185
int main(int argc, char *argv[])
189
int main(int argc, char *argv[])
186
{
190
{
187
    int tid;
191
    int tid;
188
    char *stack;
192
    char *stack;
189
    version_print();
193
    version_print();
190
 
194
 
191
/*  test_printf(); */
195
/*  test_printf(); */
192
//  test_ping();
196
//  test_ping();
193
//  test_async_ipc();
197
//  test_async_ipc();
194
//  test_advanced_ipc();
198
//  test_advanced_ipc();
195
    test_connection_ipc();
199
    test_connection_ipc();
196
   
200
   
197
    stack = (char *) malloc(getpagesize());
201
    stack = (char *) malloc(getpagesize());
198
    if (!stack) {
202
    if (!stack) {
199
        printf("Malloc failed.\n");
203
        printf("Malloc failed.\n");
200
    } else {
204
    } else {
201
        if ((tid = thread_create(utest, NULL, stack, "utest") != -1)) {
205
        if ((tid = thread_create(utest, NULL, stack, "utest") != -1)) {
202
            printf("Created thread tid=%d\n", tid);
206
            printf("Created thread tid=%d\n", tid);
203
        }
207
        }
204
    }
208
    }
205
   
209
   
206
    return 0;
210
    return 0;
207
}
211
}
208
 
212