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