Details | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
2307 | hudecek | 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 | |||
29 | #include <stdio.h> |
||
30 | #include <unistd.h> |
||
31 | #include <errno.h> |
||
32 | #include "../tester.h" |
||
33 | |||
34 | char * test_answer(bool quiet) |
||
35 | { |
||
36 | int i,cnt, errn = 0; |
||
37 | char c; |
||
38 | |||
39 | cnt = 0; |
||
40 | for (i = 0;i < 50; i++) { |
||
41 | if (callids[i]) { |
||
42 | printf("%d: %P\n", cnt, callids[i]); |
||
43 | cnt++; |
||
44 | } |
||
45 | if (cnt >= 10) |
||
46 | break; |
||
47 | } |
||
48 | if (!cnt) |
||
49 | return; |
||
50 | printf("Choose message:\n"); |
||
51 | do { |
||
52 | c = getchar(); |
||
53 | } while (c < '0' || (c-'0') >= cnt); |
||
54 | cnt = c - '0' + 1; |
||
55 | |||
56 | for (i = 0; cnt; i++) |
||
57 | if (callids[i]) |
||
58 | cnt--; |
||
59 | i -= 1; |
||
60 | |||
61 | printf("Normal (n) or hangup (h) or error(e) message?\n"); |
||
62 | do { |
||
63 | c = getchar(); |
||
64 | } while (c != 'n' && c != 'h' && c != 'e'); |
||
65 | if (c == 'n') |
||
66 | errn = 0; |
||
67 | else if (c == 'h') |
||
68 | errn = EHANGUP; |
||
69 | else if (c == 'e') |
||
70 | errn = ENOENT; |
||
71 | printf("Answering %P\n", callids[i]); |
||
72 | ipc_answer_fast(callids[i], errn, 0, 0); |
||
73 | callids[i] = 0; |
||
74 | |||
75 | return NULL; |
||
76 | } |