Subversion Repositories HelenOS-historic

Rev

Rev 1061 | Rev 1073 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

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