Rev 1049 | Rev 1065 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 447 | decky | 1 | /* |
| 2 | * Copyright (C) 2005 Martin Decky |
||
| 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 | |||
| 713 | decky | 29 | #include "version.h" |
| 954 | palkovsky | 30 | #include <ipc.h> |
| 988 | palkovsky | 31 | #include <stdio.h> |
| 32 | #include <unistd.h> |
||
| 33 | #include <stdlib.h> |
||
| 1028 | palkovsky | 34 | #include <ns.h> |
| 999 | palkovsky | 35 | |
| 1049 | cejka | 36 | |
| 995 | cejka | 37 | static void test_printf(void) |
| 38 | { |
||
| 39 | printf("Simple text.\n"); |
||
| 40 | printf("Now insert '%s' string.\n","this"); |
||
| 41 | printf("We are brave enought to print numbers like %%d = '%d'\n", 0x123456); |
||
| 42 | printf("And now... '%b' byte! '%w' word! '%W' Word! \n", 0x12, 0x1234, 0x1234); |
||
| 1049 | cejka | 43 | printf("'%Q' Q! Another '%q' q! \n", 0x1234567887654321ll, 0x1234567887654321ll); |
| 44 | printf("'%Q' with 64bit value and '%p' with 32 bit value. \n", 0x1234567887654321ll, 0x12345678 ); |
||
| 45 | printf("'%Q' 64bit, '%p' 32bit, '%b' 8bit, '%w' 16bit, '%Q' 64bit and '%s' string.\n", 0x1234567887654321ll, 0x12345678, 0x12, 0x1234, 0x1234567887654321ull, "Lovely string" ); |
||
| 46 | |||
| 995 | cejka | 47 | printf("Thats all, folks!\n"); |
| 48 | } |
||
| 999 | palkovsky | 49 | |
| 1049 | cejka | 50 | |
| 1028 | palkovsky | 51 | extern char _heap; |
| 994 | jermar | 52 | static void test_mremap(void) |
| 988 | palkovsky | 53 | { |
| 54 | printf("Writing to good memory\n"); |
||
| 55 | mremap(&_heap, 120000, 0); |
||
| 56 | printf("%P\n", ((char *)&_heap)); |
||
| 57 | printf("%P\n", ((char *)&_heap) + 80000); |
||
| 58 | *(((char *)&_heap) + 80000) = 10; |
||
| 59 | printf("Making small\n"); |
||
| 60 | mremap(&_heap, 16000, 0); |
||
| 61 | printf("Failing..\n"); |
||
| 62 | *((&_heap) + 80000) = 10; |
||
| 63 | |||
| 64 | printf("memory done\n"); |
||
| 65 | } |
||
| 66 | /* |
||
| 67 | static void test_sbrk(void) |
||
| 68 | { |
||
| 69 | printf("Writing to good memory\n"); |
||
| 70 | printf("Got: %P\n", sbrk(120000)); |
||
| 71 | printf("%P\n", ((char *)&_heap)); |
||
| 72 | printf("%P\n", ((char *)&_heap) + 80000); |
||
| 73 | *(((char *)&_heap) + 80000) = 10; |
||
| 74 | printf("Making small, got: %P\n",sbrk(-120000)); |
||
| 75 | printf("Testing access to heap\n"); |
||
| 76 | _heap = 10; |
||
| 77 | printf("Failing..\n"); |
||
| 78 | *((&_heap) + 80000) = 10; |
||
| 79 | |||
| 80 | printf("memory done\n"); |
||
| 81 | } |
||
| 82 | */ |
||
| 83 | /* |
||
| 84 | static void test_malloc(void) |
||
| 85 | { |
||
| 86 | char *data; |
||
| 87 | |||
| 88 | data = malloc(10); |
||
| 89 | printf("Heap: %P, data: %P\n", &_heap, data); |
||
| 90 | data[0] = 'a'; |
||
| 91 | free(data); |
||
| 92 | } |
||
| 93 | */ |
||
| 94 | |||
| 1028 | palkovsky | 95 | |
| 96 | static void test_ping(void) |
||
| 97 | { |
||
| 98 | ipcarg_t result; |
||
| 99 | int retval; |
||
| 100 | |||
| 101 | retval = ipc_call_sync(PHONE_NS, NS_PING, 0xbeef,&result); |
||
| 102 | printf("Retval: %d - received: %P\n", retval, result); |
||
| 103 | } |
||
| 104 | |||
| 999 | palkovsky | 105 | static void got_answer(void *private, int retval, ipc_data_t *data) |
| 106 | { |
||
| 107 | printf("Retval: %d...%s...%X, %X\n", retval, private, |
||
| 108 | IPC_GET_ARG1(*data), IPC_GET_ARG2(*data)); |
||
| 109 | } |
||
| 110 | static void test_async_ipc(void) |
||
| 111 | { |
||
| 1028 | palkovsky | 112 | ipc_call_t data; |
| 999 | palkovsky | 113 | int i; |
| 114 | |||
| 115 | printf("Sending ping\n"); |
||
| 116 | ipc_call_async_2(PHONE_NS, NS_PING, 1, 0xbeefbee2, |
||
| 117 | "Pong1", got_answer); |
||
| 118 | ipc_call_async_2(PHONE_NS, NS_PING, 2, 0xbeefbee4, |
||
| 119 | "Pong2", got_answer); |
||
| 120 | ipc_call_async_2(PHONE_NS, NS_PING, 3, 0xbeefbee4, |
||
| 121 | "Pong3", got_answer); |
||
| 122 | ipc_call_async_2(PHONE_NS, NS_PING, 4, 0xbeefbee4, |
||
| 123 | "Pong4", got_answer); |
||
| 124 | ipc_call_async_2(PHONE_NS, NS_PING, 5, 0xbeefbee4, |
||
| 125 | "Pong5", got_answer); |
||
| 126 | ipc_call_async_2(PHONE_NS, NS_PING, 6, 0xbeefbee4, |
||
| 127 | "Pong6", got_answer); |
||
| 128 | printf("Waiting forever...\n"); |
||
| 129 | for (i=0; i<100;i++) |
||
| 130 | printf("."); |
||
| 131 | printf("\n"); |
||
| 132 | ipc_wait_for_call(&data, NULL); |
||
| 133 | printf("Received call???\n"); |
||
| 134 | } |
||
| 135 | |||
| 1028 | palkovsky | 136 | |
| 137 | static void got_answer_2(void *private, int retval, ipc_data_t *data) |
||
| 138 | { |
||
| 139 | printf("Pong\n"); |
||
| 140 | } |
||
| 141 | static void test_advanced_ipc(void) |
||
| 142 | { |
||
| 143 | int res; |
||
| 144 | unsigned long long taskid; |
||
| 145 | ipc_callid_t callid; |
||
| 146 | ipc_call_t data; |
||
| 1061 | palkovsky | 147 | int i; |
| 1028 | palkovsky | 148 | |
| 149 | printf("Asking 0 to connect to me...\n"); |
||
| 150 | res = ipc_connect_to_me(0, 1, 2, &taskid); |
||
| 151 | printf("Result: %d - taskid: %Q\n", res, taskid); |
||
| 1061 | palkovsky | 152 | for (i=0; i < 100; i++) { |
| 1028 | palkovsky | 153 | printf("----------------\n"); |
| 154 | ipc_call_async(PHONE_NS, NS_PING_SVC, 0, "prov", |
||
| 155 | got_answer_2); |
||
| 156 | callid = ipc_wait_for_call(&data, NULL); |
||
| 157 | printf("Received ping\n"); |
||
| 158 | ipc_answer(callid, 0, 0, 0); |
||
| 1061 | palkovsky | 159 | } |
| 160 | callid = ipc_wait_for_call(&data, NULL); |
||
| 1028 | palkovsky | 161 | } |
| 162 | |||
| 1061 | palkovsky | 163 | static void test_connection_ipc(void) |
| 164 | { |
||
| 165 | int res; |
||
| 166 | ipcarg_t result; |
||
| 167 | |||
| 168 | printf("Starting connect...\n"); |
||
| 169 | res = ipc_connect_me_to(PHONE_NS, 10, 20); |
||
| 170 | printf("Connected: %d\n", res); |
||
| 171 | printf("pinging.\n"); |
||
| 172 | res = ipc_call_sync(res, NS_PING, 0xbeef,&result); |
||
| 173 | printf("Retval: %d - received: %P\n", res, result); |
||
| 174 | |||
| 175 | } |
||
| 176 | |||
| 447 | decky | 177 | int main(int argc, char *argv[]) |
| 178 | { |
||
| 713 | decky | 179 | version_print(); |
| 954 | palkovsky | 180 | |
| 1049 | cejka | 181 | /* test_printf(); */ |
| 1028 | palkovsky | 182 | // test_ping(); |
| 183 | // test_async_ipc(); |
||
| 1061 | palkovsky | 184 | // test_advanced_ipc(); |
| 185 | test_connection_ipc(); |
||
| 447 | decky | 186 | return 0; |
| 187 | } |