Subversion Repositories HelenOS

Rev

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

  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. /** @addtogroup genericipc
  30.  * @{
  31.  */
  32. /** @file
  33.  */
  34.  
  35. /* Lock ordering
  36.  *
  37.  * First the answerbox, then the phone.
  38.  */
  39.  
  40. #include <synch/synch.h>
  41. #include <synch/spinlock.h>
  42. #include <synch/mutex.h>
  43. #include <synch/waitq.h>
  44. #include <synch/synch.h>
  45. #include <ipc/ipc.h>
  46. #include <errno.h>
  47. #include <mm/slab.h>
  48. #include <arch.h>
  49. #include <proc/task.h>
  50. #include <memstr.h>
  51. #include <debug.h>
  52.  
  53. #include <print.h>
  54. #include <proc/thread.h>
  55. #include <arch/interrupt.h>
  56. #include <ipc/irq.h>
  57.  
  58. /** Open channel that is assigned automatically to new tasks */
  59. answerbox_t *ipc_phone_0 = NULL;
  60.  
  61. static slab_cache_t *ipc_call_slab;
  62.  
  63. /** Initialize a call structure.
  64.  *
  65.  * @param call      Call structure to be initialized.
  66.  */
  67. static void _ipc_call_init(call_t *call)
  68. {
  69.     memsetb(call, sizeof(*call), 0);
  70.     call->callerbox = &TASK->answerbox;
  71.     call->sender = TASK;
  72.     call->buffer = NULL;
  73. }
  74.  
  75. /** Allocate and initialize a call structure.
  76.  *
  77.  * The call is initialized, so that the reply will be directed to
  78.  * TASK->answerbox.
  79.  *
  80.  * @param flags     Parameters for slab_alloc (e.g FRAME_ATOMIC).
  81.  *
  82.  * @return      If flags permit it, return NULL, or initialized kernel
  83.  *          call structure.
  84.  */
  85. call_t *ipc_call_alloc(int flags)
  86. {
  87.     call_t *call;
  88.  
  89.     call = slab_alloc(ipc_call_slab, flags);
  90.     if (call)
  91.         _ipc_call_init(call);
  92.  
  93.     return call;
  94. }
  95.  
  96. /** Initialize a statically allocated call structure.
  97.  *
  98.  * @param call      Statically allocated kernel call structure to be
  99.  *          initialized.
  100.  */
  101. void ipc_call_static_init(call_t *call)
  102. {
  103.     _ipc_call_init(call);
  104.     call->flags |= IPC_CALL_STATIC_ALLOC;
  105. }
  106.  
  107. /** Deallocate a call structure.
  108.  *
  109.  * @param call      Call structure to be freed.
  110.  */
  111. void ipc_call_free(call_t *call)
  112. {
  113.     ASSERT(!(call->flags & IPC_CALL_STATIC_ALLOC));
  114.     /* Check to see if we have data in the IPC_M_DATA_SEND buffer. */
  115.     if (call->buffer)
  116.         free(call->buffer);
  117.     slab_free(ipc_call_slab, call);
  118. }
  119.  
  120. /** Initialize an answerbox structure.
  121.  *
  122.  * @param box       Answerbox structure to be initialized.
  123.  * @param task      Task to which the answerbox belongs.
  124.  */
  125. void ipc_answerbox_init(answerbox_t *box, task_t *task)
  126. {
  127.     spinlock_initialize(&box->lock, "ipc_box_lock");
  128.     spinlock_initialize(&box->irq_lock, "ipc_box_irqlock");
  129.     waitq_initialize(&box->wq);
  130.     list_initialize(&box->connected_phones);
  131.     list_initialize(&box->calls);
  132.     list_initialize(&box->dispatched_calls);
  133.     list_initialize(&box->answers);
  134.     list_initialize(&box->irq_notifs);
  135.     list_initialize(&box->irq_head);
  136.     box->task = task;
  137. }
  138.  
  139. /** Connect a phone to an answerbox.
  140.  *
  141.  * @param phone     Initialized phone structure.
  142.  * @param box       Initialized answerbox structure.
  143.  */
  144. void ipc_phone_connect(phone_t *phone, answerbox_t *box)
  145. {
  146.     mutex_lock(&phone->lock);
  147.  
  148.     phone->state = IPC_PHONE_CONNECTED;
  149.     phone->callee = box;
  150.  
  151.     spinlock_lock(&box->lock);
  152.     list_append(&phone->link, &box->connected_phones);
  153.     spinlock_unlock(&box->lock);
  154.  
  155.     mutex_unlock(&phone->lock);
  156. }
  157.  
  158. /** Initialize a phone structure.
  159.  *
  160.  * @param phone     Phone structure to be initialized.
  161.  */
  162. void ipc_phone_init(phone_t *phone)
  163. {
  164.     mutex_initialize(&phone->lock, MUTEX_PASSIVE);
  165.     phone->callee = NULL;
  166.     phone->state = IPC_PHONE_FREE;
  167.     atomic_set(&phone->active_calls, 0);
  168. }
  169.  
  170. /** Helper function to facilitate synchronous calls.
  171.  *
  172.  * @param phone     Destination kernel phone structure.
  173.  * @param request   Call structure with request.
  174.  */
  175. void ipc_call_sync(phone_t *phone, call_t *request)
  176. {
  177.     answerbox_t sync_box;
  178.  
  179.     ipc_answerbox_init(&sync_box, TASK);
  180.  
  181.     /* We will receive data in a special box. */
  182.     request->callerbox = &sync_box;
  183.  
  184.     ipc_call(phone, request);
  185.     ipc_wait_for_call(&sync_box, SYNCH_NO_TIMEOUT, SYNCH_FLAGS_NONE);
  186. }
  187.  
  188. /** Answer a message which was not dispatched and is not listed in any queue.
  189.  *
  190.  * @param call      Call structure to be answered.
  191.  */
  192. static void _ipc_answer_free_call(call_t *call)
  193. {
  194.     answerbox_t *callerbox = call->callerbox;
  195.  
  196.     call->flags |= IPC_CALL_ANSWERED;
  197.  
  198.     if (call->flags & IPC_CALL_FORWARDED) {
  199.         if (call->data.caller_phone) {
  200.             /* Demasquerade the caller phone. */
  201.             call->data.phone = call->data.caller_phone;
  202.         }
  203.     }
  204.  
  205.     spinlock_lock(&callerbox->lock);
  206.     list_append(&call->link, &callerbox->answers);
  207.     spinlock_unlock(&callerbox->lock);
  208.     waitq_wakeup(&callerbox->wq, WAKEUP_FIRST);
  209. }
  210.  
  211. /** Answer a message which is in a callee queue.
  212.  *
  213.  * @param box       Answerbox that is answering the message.
  214.  * @param call      Modified request that is being sent back.
  215.  */
  216. void ipc_answer(answerbox_t *box, call_t *call)
  217. {
  218.     /* Remove from active box */
  219.     spinlock_lock(&box->lock);
  220.     list_remove(&call->link);
  221.     spinlock_unlock(&box->lock);
  222.     /* Send back answer */
  223.     _ipc_answer_free_call(call);
  224. }
  225.  
  226. /** Simulate sending back a message.
  227.  *
  228.  * Most errors are better handled by forming a normal backward
  229.  * message and sending it as a normal answer.
  230.  *
  231.  * @param phone     Phone structure the call should appear to come from.
  232.  * @param call      Call structure to be answered.
  233.  * @param err       Return value to be used for the answer.
  234.  */
  235. void ipc_backsend_err(phone_t *phone, call_t *call, unative_t err)
  236. {
  237.     call->data.phone = phone;
  238.     atomic_inc(&phone->active_calls);
  239.     IPC_SET_RETVAL(call->data, err);
  240.     _ipc_answer_free_call(call);
  241. }
  242.  
  243. /** Unsafe unchecking version of ipc_call.
  244.  *
  245.  * @param phone     Phone structure the call comes from.
  246.  * @param box       Destination answerbox structure.
  247.  * @param call      Call structure with request.
  248.  */
  249. static void _ipc_call(phone_t *phone, answerbox_t *box, call_t *call)
  250. {
  251.     if (!(call->flags & IPC_CALL_FORWARDED)) {
  252.         atomic_inc(&phone->active_calls);
  253.         call->data.phone = phone;
  254.     }
  255.  
  256.     spinlock_lock(&box->lock);
  257.     list_append(&call->link, &box->calls);
  258.     spinlock_unlock(&box->lock);
  259.     waitq_wakeup(&box->wq, WAKEUP_FIRST);
  260. }
  261.  
  262. /** Send an asynchronous request using a phone to an answerbox.
  263.  *
  264.  * @param phone     Phone structure the call comes from and which is
  265.  *          connected to the destination answerbox.
  266.  * @param call      Call structure with request.
  267.  *
  268.  * @return      Return 0 on success, ENOENT on error.
  269.  */
  270. int ipc_call(phone_t *phone, call_t *call)
  271. {
  272.     answerbox_t *box;
  273.  
  274.     mutex_lock(&phone->lock);
  275.     if (phone->state != IPC_PHONE_CONNECTED) {
  276.         mutex_unlock(&phone->lock);
  277.         if (call->flags & IPC_CALL_FORWARDED) {
  278.             IPC_SET_RETVAL(call->data, EFORWARD);
  279.             _ipc_answer_free_call(call);
  280.         } else {
  281.             if (phone->state == IPC_PHONE_HUNGUP)
  282.                 ipc_backsend_err(phone, call, EHANGUP);
  283.             else
  284.                 ipc_backsend_err(phone, call, ENOENT);
  285.         }
  286.         return ENOENT;
  287.     }
  288.     box = phone->callee;
  289.     _ipc_call(phone, box, call);
  290.    
  291.     mutex_unlock(&phone->lock);
  292.     return 0;
  293. }
  294.  
  295. /** Disconnect phone from answerbox.
  296.  *
  297.  * This call leaves the phone in the HUNGUP state. The change to 'free' is done
  298.  * lazily later.
  299.  *
  300.  * @param phone     Phone structure to be hung up.
  301.  *              
  302.  * @return      Return 0 if the phone is disconnected.
  303.  *          Return -1 if the phone was already disconnected.
  304.  */
  305. int ipc_phone_hangup(phone_t *phone)
  306. {
  307.     answerbox_t *box;
  308.     call_t *call;
  309.    
  310.     mutex_lock(&phone->lock);
  311.     if (phone->state == IPC_PHONE_FREE ||
  312.         phone->state == IPC_PHONE_HUNGUP ||
  313.         phone->state == IPC_PHONE_CONNECTING) {
  314.         mutex_unlock(&phone->lock);
  315.         return -1;
  316.     }
  317.     box = phone->callee;
  318.     if (phone->state != IPC_PHONE_SLAMMED) {
  319.         /* Remove myself from answerbox */
  320.         spinlock_lock(&box->lock);
  321.         list_remove(&phone->link);
  322.         spinlock_unlock(&box->lock);
  323.  
  324.         if (phone->state != IPC_PHONE_SLAMMED) {
  325.             call = ipc_call_alloc(0);
  326.             IPC_SET_METHOD(call->data, IPC_M_PHONE_HUNGUP);
  327.             call->flags |= IPC_CALL_DISCARD_ANSWER;
  328.             _ipc_call(phone, box, call);
  329.         }
  330.     }
  331.  
  332.     phone->state = IPC_PHONE_HUNGUP;
  333.     mutex_unlock(&phone->lock);
  334.  
  335.     return 0;
  336. }
  337.  
  338. /** Forwards call from one answerbox to another one.
  339.  *
  340.  * @param call      Call structure to be redirected.
  341.  * @param newphone  Phone structure to target answerbox.
  342.  * @param oldbox    Old answerbox structure.
  343.  * @param mode      Flags that specify mode of the forward operation.
  344.  *
  345.  * @return      Return 0 if forwarding succeeded or an error code if
  346.  *          there was error.
  347.  *
  348.  * The return value serves only as an information for the forwarder,
  349.  * the original caller is notified automatically with EFORWARD.
  350.  */
  351. int ipc_forward(call_t *call, phone_t *newphone, answerbox_t *oldbox, int mode)
  352. {
  353.     spinlock_lock(&oldbox->lock);
  354.     list_remove(&call->link);
  355.     spinlock_unlock(&oldbox->lock);
  356.  
  357.     if (mode & IPC_FF_ROUTE_FROM_ME) {
  358.         if (!call->data.caller_phone)
  359.             call->data.caller_phone = call->data.phone;
  360.         call->data.phone = newphone;
  361.     }
  362.  
  363.     return ipc_call(newphone, call);
  364. }
  365.  
  366.  
  367. /** Wait for a phone call.
  368.  *
  369.  * @param box       Answerbox expecting the call.
  370.  * @param usec      Timeout in microseconds. See documentation for
  371.  *          waitq_sleep_timeout() for decription of its special
  372.  *          meaning.
  373.  * @param flags     Select mode of sleep operation. See documentation for
  374.  *          waitq_sleep_timeout() for description of its special
  375.  *          meaning.
  376.  * @return      Recived call structure or NULL.
  377.  *
  378.  * To distinguish between a call and an answer, have a look at call->flags.
  379.  */
  380. call_t *ipc_wait_for_call(answerbox_t *box, uint32_t usec, int flags)
  381. {
  382.     call_t *request;
  383.     ipl_t ipl;
  384.     int rc;
  385.  
  386. restart:
  387.     rc = waitq_sleep_timeout(&box->wq, usec, flags);
  388.     if (SYNCH_FAILED(rc))
  389.         return NULL;
  390.    
  391.     spinlock_lock(&box->lock);
  392.     if (!list_empty(&box->irq_notifs)) {
  393.         ipl = interrupts_disable();
  394.         spinlock_lock(&box->irq_lock);
  395.  
  396.         request = list_get_instance(box->irq_notifs.next, call_t, link);
  397.         list_remove(&request->link);
  398.  
  399.         spinlock_unlock(&box->irq_lock);
  400.         interrupts_restore(ipl);
  401.     } else if (!list_empty(&box->answers)) {
  402.         /* Handle asynchronous answers */
  403.         request = list_get_instance(box->answers.next, call_t, link);
  404.         list_remove(&request->link);
  405.         atomic_dec(&request->data.phone->active_calls);
  406.     } else if (!list_empty(&box->calls)) {
  407.         /* Handle requests */
  408.         request = list_get_instance(box->calls.next, call_t, link);
  409.         list_remove(&request->link);
  410.         /* Append request to dispatch queue */
  411.         list_append(&request->link, &box->dispatched_calls);
  412.     } else {
  413.         /* This can happen regularly after ipc_cleanup */
  414.         spinlock_unlock(&box->lock);
  415.         goto restart;
  416.     }
  417.     spinlock_unlock(&box->lock);
  418.     return request;
  419. }
  420.  
  421. /** Answer all calls from list with EHANGUP answer.
  422.  *
  423.  * @param lst       Head of the list to be cleaned up.
  424.  */
  425. static void ipc_cleanup_call_list(link_t *lst)
  426. {
  427.     call_t *call;
  428.  
  429.     while (!list_empty(lst)) {
  430.         call = list_get_instance(lst->next, call_t, link);
  431.         if (call->buffer)
  432.             free(call->buffer);
  433.         list_remove(&call->link);
  434.  
  435.         IPC_SET_RETVAL(call->data, EHANGUP);
  436.         _ipc_answer_free_call(call);
  437.     }
  438. }
  439.  
  440. /** Cleans up all IPC communication of the current task.
  441.  *
  442.  * Note: ipc_hangup sets returning answerbox to TASK->answerbox, you
  443.  * have to change it as well if you want to cleanup other tasks than TASK.
  444.  */
  445. void ipc_cleanup(void)
  446. {
  447.     int i;
  448.     call_t *call;
  449.     phone_t *phone;
  450.     DEADLOCK_PROBE_INIT(p_phonelck);
  451.  
  452.     /* Disconnect all our phones ('ipc_phone_hangup') */
  453.     for (i = 0; i < IPC_MAX_PHONES; i++)
  454.         ipc_phone_hangup(&TASK->phones[i]);
  455.  
  456.     /* Disconnect all connected irqs */
  457.     ipc_irq_cleanup(&TASK->answerbox);
  458.  
  459.     /* Disconnect all phones connected to our answerbox */
  460. restart_phones:
  461.     spinlock_lock(&TASK->answerbox.lock);
  462.     while (!list_empty(&TASK->answerbox.connected_phones)) {
  463.         phone = list_get_instance(TASK->answerbox.connected_phones.next,
  464.             phone_t, link);
  465.         if (SYNCH_FAILED(mutex_trylock(&phone->lock))) {
  466.             spinlock_unlock(&TASK->answerbox.lock);
  467.             DEADLOCK_PROBE(p_phonelck, DEADLOCK_THRESHOLD);
  468.             goto restart_phones;
  469.         }
  470.        
  471.         /* Disconnect phone */
  472.         ASSERT(phone->state == IPC_PHONE_CONNECTED);
  473.         phone->state = IPC_PHONE_SLAMMED;
  474.         list_remove(&phone->link);
  475.  
  476.         mutex_unlock(&phone->lock);
  477.     }
  478.  
  479.     /* Answer all messages in 'calls' and 'dispatched_calls' queues */
  480.     ipc_cleanup_call_list(&TASK->answerbox.dispatched_calls);
  481.     ipc_cleanup_call_list(&TASK->answerbox.calls);
  482.     spinlock_unlock(&TASK->answerbox.lock);
  483.    
  484.     /* Wait for all async answers to arrive */
  485.     while (1) {
  486.         /* Go through all phones, until all are FREE... */
  487.         /* Locking not needed, no one else should modify
  488.          * it, when we are in cleanup */
  489.         for (i = 0; i < IPC_MAX_PHONES; i++) {
  490.             if (TASK->phones[i].state == IPC_PHONE_HUNGUP &&
  491.                 atomic_get(&TASK->phones[i].active_calls) == 0)
  492.                 TASK->phones[i].state = IPC_PHONE_FREE;
  493.            
  494.             /* Just for sure, we might have had some
  495.              * IPC_PHONE_CONNECTING phones */
  496.             if (TASK->phones[i].state == IPC_PHONE_CONNECTED)
  497.                 ipc_phone_hangup(&TASK->phones[i]);
  498.             /* If the hangup succeeded, it has sent a HANGUP
  499.              * message, the IPC is now in HUNGUP state, we
  500.              * wait for the reply to come */
  501.            
  502.             if (TASK->phones[i].state != IPC_PHONE_FREE)
  503.                 break;
  504.         }
  505.         /* Voila, got into cleanup */
  506.         if (i == IPC_MAX_PHONES)
  507.             break;
  508.        
  509.         call = ipc_wait_for_call(&TASK->answerbox, SYNCH_NO_TIMEOUT,
  510.             SYNCH_FLAGS_NONE);
  511.         ASSERT((call->flags & IPC_CALL_ANSWERED) ||
  512.             (call->flags & IPC_CALL_NOTIF));
  513.         ASSERT(!(call->flags & IPC_CALL_STATIC_ALLOC));
  514.        
  515.         atomic_dec(&TASK->active_calls);
  516.         ipc_call_free(call);
  517.     }
  518. }
  519.  
  520.  
  521. /** Initilize IPC subsystem */
  522. void ipc_init(void)
  523. {
  524.     ipc_call_slab = slab_cache_create("ipc_call", sizeof(call_t), 0, NULL,
  525.         NULL, 0);
  526. }
  527.  
  528.  
  529. /** List answerbox contents.
  530.  *
  531.  * @param taskid    Task ID.
  532.  */
  533. void ipc_print_task(task_id_t taskid)
  534. {
  535.     task_t *task;
  536.     int i;
  537.     call_t *call;
  538.     link_t *tmp;
  539.    
  540.     spinlock_lock(&tasks_lock);
  541.     task = task_find_by_id(taskid);
  542.     if (task)
  543.         spinlock_lock(&task->lock);
  544.     spinlock_unlock(&tasks_lock);
  545.     if (!task)
  546.         return;
  547.  
  548.     /* Print opened phones & details */
  549.     printf("PHONE:\n");
  550.     for (i = 0; i < IPC_MAX_PHONES; i++) {
  551.         if (SYNCH_FAILED(mutex_trylock(&task->phones[i].lock))) {
  552.             printf("%d: mutex busy\n", i);
  553.             continue;
  554.         }
  555.         if (task->phones[i].state != IPC_PHONE_FREE) {
  556.             printf("%d: ", i);
  557.             switch (task->phones[i].state) {
  558.             case IPC_PHONE_CONNECTING:
  559.                 printf("connecting ");
  560.                 break;
  561.             case IPC_PHONE_CONNECTED:
  562.                 printf("connected to: %p ",
  563.                        task->phones[i].callee);
  564.                 break;
  565.             case IPC_PHONE_SLAMMED:
  566.                 printf("slammed by: %p ",
  567.                        task->phones[i].callee);
  568.                 break;
  569.             case IPC_PHONE_HUNGUP:
  570.                 printf("hung up - was: %p ",
  571.                        task->phones[i].callee);
  572.                 break;
  573.             default:
  574.                 break;
  575.             }
  576.             printf("active: %ld\n",
  577.                 atomic_get(&task->phones[i].active_calls));
  578.         }
  579.         mutex_unlock(&task->phones[i].lock);
  580.     }
  581.  
  582.  
  583.     /* Print answerbox - calls */
  584.     spinlock_lock(&task->answerbox.lock);
  585.     printf("ABOX - CALLS:\n");
  586.     for (tmp = task->answerbox.calls.next; tmp != &task->answerbox.calls;
  587.         tmp = tmp->next) {
  588.         call = list_get_instance(tmp, call_t, link);
  589.         printf("Callid: %p Srctask:%" PRIu64 " M:%" PRIun
  590.             " A1:%" PRIun " A2:%" PRIun " A3:%" PRIun
  591.             " A4:%" PRIun " A5:%" PRIun " Flags:%x\n", call, call->sender->taskid,
  592.             IPC_GET_METHOD(call->data), IPC_GET_ARG1(call->data),
  593.             IPC_GET_ARG2(call->data), IPC_GET_ARG3(call->data),
  594.             IPC_GET_ARG4(call->data), IPC_GET_ARG5(call->data),
  595.             call->flags);
  596.     }
  597.     /* Print answerbox - calls */
  598.     printf("ABOX - DISPATCHED CALLS:\n");
  599.     for (tmp = task->answerbox.dispatched_calls.next;
  600.         tmp != &task->answerbox.dispatched_calls;
  601.         tmp = tmp->next) {
  602.         call = list_get_instance(tmp, call_t, link);
  603.         printf("Callid: %p Srctask:%" PRIu64 " M:%" PRIun
  604.             " A1:%" PRIun " A2:%" PRIun " A3:%" PRIun
  605.             " A4:%" PRIun " A5:%" PRIun " Flags:%x\n", call, call->sender->taskid,
  606.             IPC_GET_METHOD(call->data), IPC_GET_ARG1(call->data),
  607.             IPC_GET_ARG2(call->data), IPC_GET_ARG3(call->data),
  608.             IPC_GET_ARG4(call->data), IPC_GET_ARG5(call->data),
  609.             call->flags);
  610.     }
  611.     /* Print answerbox - calls */
  612.     printf("ABOX - ANSWERS:\n");
  613.     for (tmp = task->answerbox.answers.next; tmp != &task->answerbox.answers;
  614.         tmp = tmp->next) {
  615.         call = list_get_instance(tmp, call_t, link);
  616.         printf("Callid:%p M:%" PRIun " A1:%" PRIun " A2:%" PRIun
  617.             " A3:%" PRIun " A4:%" PRIun " A5:%" PRIun " Flags:%x\n",
  618.             call, IPC_GET_METHOD(call->data), IPC_GET_ARG1(call->data),
  619.             IPC_GET_ARG2(call->data), IPC_GET_ARG3(call->data),
  620.             IPC_GET_ARG4(call->data), IPC_GET_ARG5(call->data),
  621.             call->flags);
  622.     }
  623.  
  624.     spinlock_unlock(&task->answerbox.lock);
  625.     spinlock_unlock(&task->lock);
  626. }
  627.  
  628. /** @}
  629.  */
  630.