Rev 1657 | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1653 | cejka | 1 | /* |
2 | * Copyright (C) 2006 Ondrej Palkovsky |
||
3 | * All rights reserved. |
||
4 | * |
||
5 | * Redistribution and use in source and binary forms, with or without |
||
6 | * modification, are permitted provided that the following conditions |
||
7 | * are met: |
||
8 | * |
||
9 | * - Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * - Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
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 |
||
15 | * derived from this software without specific prior written permission. |
||
16 | * |
||
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 |
||
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
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 |
||
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 |
||
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
27 | */ |
||
28 | |||
1657 | cejka | 29 | /** @addtogroup ippc IPC Tester |
30 | * @brief IPC tester and task faulter. |
||
1653 | cejka | 31 | * @{ |
32 | */ |
||
33 | /** |
||
34 | * @file |
||
35 | */ |
||
36 | |||
1596 | palkovsky | 37 | #include <stdio.h> |
38 | #include <async.h> |
||
39 | #include <ipc/ipc.h> |
||
40 | #include <ipc/services.h> |
||
41 | #include <errno.h> |
||
42 | |||
43 | #define TEST_START 10000 |
||
44 | #define MAXLIST 4 |
||
45 | |||
46 | #define MSG_HANG_ME_UP 2000 |
||
47 | |||
48 | static int connections[50]; |
||
49 | static ipc_callid_t callids[50]; |
||
50 | static int phones[20]; |
||
51 | static int myservice = 0; |
||
52 | |||
53 | static void client_connection(ipc_callid_t iid, ipc_call_t *icall) |
||
54 | { |
||
55 | ipc_callid_t callid; |
||
56 | ipc_call_t call; |
||
57 | ipcarg_t phonehash = icall->in_phone_hash; |
||
58 | int retval; |
||
59 | int i; |
||
60 | |||
61 | printf("Connected phone: %P, accepting\n", icall->in_phone_hash); |
||
62 | ipc_answer_fast(iid, 0, 0, 0); |
||
63 | for (i=0;i < 1024;i++) |
||
64 | if (!connections[i]) { |
||
65 | connections[i] = phonehash; |
||
66 | break; |
||
67 | } |
||
68 | |||
69 | while (1) { |
||
70 | callid = async_get_call(&call); |
||
71 | switch (IPC_GET_METHOD(call)) { |
||
72 | case IPC_M_PHONE_HUNGUP: |
||
73 | printf("Phone (%P) hung up.\n", phonehash); |
||
74 | retval = 0; |
||
75 | break; |
||
76 | default: |
||
77 | printf("Received message from %P: %X\n", phonehash,callid); |
||
78 | for (i=0; i < 1024; i++) |
||
79 | if (!callids[i]) { |
||
80 | callids[i] = callid; |
||
81 | break; |
||
82 | } |
||
83 | continue; |
||
84 | } |
||
85 | ipc_answer_fast(callid, retval, 0, 0); |
||
86 | } |
||
87 | } |
||
88 | |||
89 | static void printhelp(void) |
||
90 | { |
||
91 | printf("? - help\n"); |
||
92 | printf("c - connect to other service\n"); |
||
93 | printf("h - hangup connection\n"); |
||
94 | printf("a - send async message to other service\n"); |
||
95 | printf("s - send sync message to other service\n"); |
||
96 | printf("d - answer message that we have received\n"); |
||
97 | printf("j - jump to endless loop\n"); |
||
98 | printf("p - page fault\n"); |
||
1618 | vana | 99 | printf("u - unaligned read\n"); |
1596 | palkovsky | 100 | } |
101 | |||
102 | static void callback(void *private, int retval, ipc_call_t *data) |
||
103 | { |
||
104 | printf("Received response to msg %d - retval: %d.\n", private, |
||
105 | retval); |
||
106 | } |
||
107 | |||
108 | static void do_answer_msg(void) |
||
109 | { |
||
1721 | palkovsky | 110 | int i,cnt, errn = 0; |
1596 | palkovsky | 111 | char c; |
112 | |||
113 | cnt = 0; |
||
114 | for (i=0;i < 50;i++) { |
||
115 | if (callids[i]) { |
||
116 | printf("%d: %P\n", cnt, callids[i]); |
||
117 | cnt++; |
||
118 | } |
||
119 | if (cnt >= 10) |
||
120 | break; |
||
121 | } |
||
122 | if (!cnt) |
||
123 | return; |
||
124 | printf("Choose message:\n"); |
||
125 | do { |
||
126 | c = getchar(); |
||
127 | } while (c < '0' || (c-'0') >= cnt); |
||
128 | cnt = c - '0' + 1; |
||
129 | |||
130 | for (i=0;cnt;i++) |
||
131 | if (callids[i]) |
||
132 | cnt--; |
||
133 | i -= 1; |
||
134 | |||
135 | printf("Normal (n) or hangup (h) or error(e) message?\n"); |
||
136 | do { |
||
137 | c = getchar(); |
||
138 | } while (c != 'n' && c != 'h' && c != 'e'); |
||
139 | if (c == 'n') |
||
140 | errn = 0; |
||
141 | else if (c == 'h') |
||
142 | errn = EHANGUP; |
||
143 | else if (c == 'e') |
||
144 | errn = ENOENT; |
||
145 | printf("Answering %P\n", callids[i]); |
||
146 | ipc_answer_fast(callids[i], errn, 0, 0); |
||
147 | callids[i] = 0; |
||
148 | } |
||
149 | |||
150 | static void do_send_msg(int async) |
||
151 | { |
||
152 | int phoneid; |
||
153 | int res; |
||
154 | static int msgid = 1; |
||
155 | char c; |
||
156 | |||
157 | printf("Select phoneid to send msg: 2-9\n"); |
||
158 | do { |
||
159 | c = getchar(); |
||
160 | } while (c < '2' || c > '9'); |
||
161 | phoneid = c - '0'; |
||
162 | |||
163 | if (async) { |
||
164 | ipc_call_async(phoneid, 2000, 0, (void *)msgid, callback, 1); |
||
165 | printf("Async sent - msg %d\n", msgid); |
||
166 | msgid++; |
||
167 | } else { |
||
168 | printf("Sending msg..."); |
||
169 | res = ipc_call_sync_2(phoneid, 2000, 0, 0, NULL, NULL); |
||
170 | printf("done: %d\n", res); |
||
171 | } |
||
172 | } |
||
173 | |||
174 | static void do_hangup(void) |
||
175 | { |
||
176 | char c; |
||
177 | int res; |
||
178 | int phoneid; |
||
179 | |||
180 | printf("Select phoneid to hangup: 2-9\n"); |
||
181 | do { |
||
182 | c = getchar(); |
||
183 | } while (c < '2' || c > '9'); |
||
184 | phoneid = c - '0'; |
||
185 | |||
186 | printf("Hanging up..."); |
||
187 | res = ipc_hangup(phoneid); |
||
188 | printf("done: %d\n", phoneid); |
||
189 | } |
||
190 | |||
191 | static void do_connect(void) |
||
192 | { |
||
193 | char c; |
||
194 | int svc; |
||
195 | int phid; |
||
196 | |||
197 | printf("Choose one service: 0:10000....9:10009\n"); |
||
198 | do { |
||
199 | c = getchar(); |
||
200 | } while (c < '0' || c > '9'); |
||
201 | svc = TEST_START + c - '0'; |
||
202 | if (svc == myservice) { |
||
203 | printf("Currently cannot connect to myself, update test\n"); |
||
204 | return; |
||
205 | } |
||
206 | printf("Connecting to %d..", svc); |
||
207 | phid = ipc_connect_me_to(PHONE_NS, svc, 0); |
||
208 | if (phid > 0) { |
||
209 | printf("phoneid: %d\n", phid); |
||
210 | phones[phid] = 1; |
||
211 | } else |
||
212 | printf("error: %d\n", phid); |
||
213 | } |
||
214 | |||
1618 | vana | 215 | |
216 | |||
1596 | palkovsky | 217 | int main(void) |
218 | { |
||
219 | ipcarg_t phonead; |
||
220 | int i; |
||
221 | char c; |
||
222 | int res; |
||
1618 | vana | 223 | volatile long long var; |
224 | volatile int var1; |
||
225 | |||
1596 | palkovsky | 226 | printf("********************************\n"); |
227 | printf("***********IPC Tester***********\n"); |
||
228 | printf("********************************\n"); |
||
229 | |||
230 | |||
231 | async_set_client_connection(client_connection); |
||
232 | |||
233 | for (i=TEST_START;i < TEST_START+10;i++) { |
||
234 | res = ipc_connect_to_me(PHONE_NS, i, 0, &phonead); |
||
235 | if (!res) |
||
236 | break; |
||
237 | printf("Failed registering as %d..:%d\n", i, res); |
||
238 | } |
||
239 | printf("Registered as service: %d\n", i); |
||
240 | myservice = i; |
||
241 | |||
242 | printhelp(); |
||
243 | while (1) { |
||
244 | c = getchar(); |
||
245 | switch (c) { |
||
246 | case '?': |
||
247 | printhelp(); |
||
248 | break; |
||
249 | case 'h': |
||
250 | do_hangup(); |
||
251 | break; |
||
252 | case 'c': |
||
253 | do_connect(); |
||
254 | break; |
||
255 | case 'a': |
||
256 | do_send_msg(1); |
||
257 | break; |
||
258 | case 's': |
||
259 | do_send_msg(0); |
||
260 | break; |
||
261 | case 'd': |
||
262 | do_answer_msg(); |
||
263 | break; |
||
264 | case 'j': |
||
265 | while (1) |
||
266 | ; |
||
267 | case 'p': |
||
268 | printf("Doing page fault\n"); |
||
269 | *((char *)0) = 1; |
||
270 | printf("done\n"); |
||
1618 | vana | 271 | case 'u': |
272 | var1=*( (int *) ( ( (char *)(&var) ) + 1 ) ); |
||
273 | break; |
||
1596 | palkovsky | 274 | } |
275 | } |
||
276 | } |
||
1653 | cejka | 277 | |
278 | /** @} |
||
279 | */ |
||
280 |