Subversion Repositories HelenOS-historic

Rev

Rev 1072 | Rev 1084 | 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. /* IPC resources management
  30.  *
  31.  * The goal of this source code is to properly manage IPC resources
  32.  * and allow straight and clean clean-up procedure upon task termination.
  33.  *
  34.  * The pattern of usage of the resources is:
  35.  * - allocate empty phone slot, connect | deallocate slot
  36.  * - disconnect connected phone (some messages might be on the fly)
  37.  * - find phone in slot and send a message using phone
  38.  * - answer message to phone
  39.  *
  40.  *
  41.  */
  42.  
  43. #include <synch/spinlock.h>
  44. #include <ipc/ipc.h>
  45. #include <arch.h>
  46. #include <proc/task.h>
  47. #include <ipc/ipcrsc.h>
  48. #include <debug.h>
  49.  
  50. /** Find call_t * in call table according to callid
  51.  *
  52.  * @return NULL on not found, otherwise pointer to call structure
  53.  */
  54. call_t * get_call(__native callid)
  55. {
  56.     /* TODO: Traverse list of dispatched calls and find one */
  57.     /* TODO: locking of call, ripping it from dispatched calls etc.  */
  58.     return (call_t *) callid;
  59. }
  60.  
  61. /** Return pointer to phone identified by phoneid or NULL if non-existent */
  62. phone_t * get_phone_and_lock(__native phoneid)
  63. {
  64.     phone_t *phone;
  65.  
  66.     if (phoneid >= IPC_MAX_PHONES)
  67.         return NULL;
  68.  
  69.     phone = &TASK->phones[phoneid];
  70.     spinlock_lock(&phone->lock);
  71.     if (!phone->callee) {
  72.         spinlock_unlock(&phone->lock);
  73.         return NULL;
  74.     }
  75.     /* TODO... */
  76.     spinlock_unlock(&phone->lock);
  77.     return phone;
  78. }
  79.  
  80. /** Allocate new phone slot in current TASK structure */
  81. int phone_alloc(void)
  82. {
  83.     int i;
  84.  
  85.     spinlock_lock(&TASK->lock);
  86.    
  87.     for (i=0; i < IPC_MAX_PHONES; i++) {
  88.         if (!TASK->phones[i].busy) {
  89.             TASK->phones[i].busy = 1;
  90.             break;
  91.         }
  92.     }
  93.     spinlock_unlock(&TASK->lock);
  94.  
  95.     if (i >= IPC_MAX_PHONES)
  96.         return -1;
  97.     return i;
  98. }
  99.  
  100. /** Disconnect phone */
  101. void phone_dealloc(int phoneid)
  102. {
  103.     spinlock_lock(&TASK->lock);
  104.  
  105.     ASSERT(TASK->phones[phoneid].busy);
  106.  
  107.     if (TASK->phones[phoneid].callee)
  108.         ipc_phone_destroy(&TASK->phones[phoneid]);
  109.  
  110.     TASK->phones[phoneid].busy = 0;
  111.     spinlock_unlock(&TASK->lock);
  112. }
  113.  
  114. void phone_connect(int phoneid, answerbox_t *box)
  115. {
  116.     phone_t *phone = &TASK->phones[phoneid];
  117.    
  118.     ipc_phone_connect(phone, box);
  119. }
  120.