[4e49572] | 1 | /*
|
---|
[df4ed85] | 2 | * Copyright (c) 2006 Ondrej Palkovsky
|
---|
[4e49572] | 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 |
|
---|
[cc73a8a1] | 29 | /** @addtogroup genericipc
|
---|
[b45c443] | 30 | * @{
|
---|
| 31 | */
|
---|
| 32 | /** @file
|
---|
| 33 | */
|
---|
| 34 |
|
---|
[4e49572] | 35 | /* IPC resources management
|
---|
| 36 | *
|
---|
[51ec40f] | 37 | * The goal of this source code is to properly manage IPC resources and allow
|
---|
| 38 | * straight and clean clean-up procedure upon task termination.
|
---|
[4e49572] | 39 | *
|
---|
| 40 | * The pattern of usage of the resources is:
|
---|
| 41 | * - allocate empty phone slot, connect | deallocate slot
|
---|
| 42 | * - disconnect connected phone (some messages might be on the fly)
|
---|
| 43 | * - find phone in slot and send a message using phone
|
---|
| 44 | * - answer message to phone
|
---|
[fbcfd458] | 45 | * - hangup phone (the caller has hung up)
|
---|
| 46 | * - hangup phone (the answerbox is exiting)
|
---|
[da1bafb] | 47 | *
|
---|
[ba81cab] | 48 | * Locking strategy
|
---|
| 49 | *
|
---|
[51ec40f] | 50 | * - To use a phone, disconnect a phone etc., the phone must be first locked and
|
---|
| 51 | * then checked that it is connected
|
---|
| 52 | * - To connect an allocated phone it need not be locked (assigning pointer is
|
---|
| 53 | * atomic on all platforms)
|
---|
[ba81cab] | 54 | *
|
---|
| 55 | * - To find an empty phone slot, the TASK must be locked
|
---|
| 56 | * - To answer a message, the answerbox must be locked
|
---|
| 57 | * - The locking of phone and answerbox is done at the ipc_ level.
|
---|
[51ec40f] | 58 | * It is perfectly correct to pass unconnected phone to these functions and
|
---|
| 59 | * proper reply will be generated.
|
---|
[ba81cab] | 60 | *
|
---|
| 61 | * Locking order
|
---|
| 62 | *
|
---|
| 63 | * - first phone, then answerbox
|
---|
| 64 | * + Easy locking on calls
|
---|
[51ec40f] | 65 | * - Very hard traversing list of phones when disconnecting because the phones
|
---|
| 66 | * may disconnect during traversal of list of connected phones. The only
|
---|
| 67 | * possibility is try_lock with restart of list traversal.
|
---|
[ba81cab] | 68 | *
|
---|
[fbcfd458] | 69 | * Destroying is less frequent, this approach is taken.
|
---|
| 70 | *
|
---|
[7c7aae16] | 71 | * Phone call
|
---|
| 72 | *
|
---|
| 73 | * *** Connect_me_to ***
|
---|
[51ec40f] | 74 | * The caller sends IPC_M_CONNECT_ME_TO to an answerbox. The server receives
|
---|
[38c706cc] | 75 | * 'phoneid' of the connecting phone as an ARG5. If it answers with RETVAL=0,
|
---|
[51ec40f] | 76 | * the phonecall is accepted, otherwise it is refused.
|
---|
[7c7aae16] | 77 | *
|
---|
| 78 | * *** Connect_to_me ***
|
---|
[51ec40f] | 79 | * The caller sends IPC_M_CONNECT_TO_ME.
|
---|
| 80 | * The server receives an automatically opened phoneid. If it accepts
|
---|
| 81 | * (RETVAL=0), it can use the phoneid immediately.
|
---|
| 82 | * Possible race condition can arise, when the client receives messages from new
|
---|
| 83 | * connection before getting response for connect_to_me message. Userspace
|
---|
| 84 | * should implement handshake protocol that would control it.
|
---|
[7c7aae16] | 85 | *
|
---|
[fbcfd458] | 86 | * Phone hangup
|
---|
[da1bafb] | 87 | *
|
---|
[fbcfd458] | 88 | * *** The caller hangs up (sys_ipc_hangup) ***
|
---|
| 89 | * - The phone is disconnected (no more messages can be sent over this phone),
|
---|
[51ec40f] | 90 | * all in-progress messages are correctly handled. The answerbox receives
|
---|
[fbcfd458] | 91 | * IPC_M_PHONE_HUNGUP call from the phone that hung up. When all async
|
---|
| 92 | * calls are answered, the phone is deallocated.
|
---|
[ba81cab] | 93 | *
|
---|
[9f22213] | 94 | * *** The answerbox hangs up (ipc_answer(EHANGUP))
|
---|
| 95 | * - The phone is disconnected. EHANGUP response code is sent
|
---|
[f3a3f0d7] | 96 | * to the calling task. All new calls through this phone
|
---|
[9f22213] | 97 | * get a EHUNGUP error code, the task is expected to
|
---|
[06e1e95] | 98 | * send an sys_ipc_hangup after cleaning up its internal structures.
|
---|
[ba81cab] | 99 | *
|
---|
[9f22213] | 100 | * Call forwarding
|
---|
[da1bafb] | 101 | *
|
---|
[9f22213] | 102 | * The call can be forwarded, so that the answer to call is passed directly
|
---|
| 103 | * to the original sender. However, this poses special problems regarding
|
---|
| 104 | * routing of hangup messages.
|
---|
| 105 | *
|
---|
| 106 | * sys_ipc_hangup -> IPC_M_PHONE_HUNGUP
|
---|
| 107 | * - this message CANNOT be forwarded
|
---|
| 108 | *
|
---|
| 109 | * EHANGUP during forward
|
---|
| 110 | * - The *forwarding* phone will be closed, EFORWARD is sent to receiver.
|
---|
| 111 | *
|
---|
| 112 | * EHANGUP, ENOENT during forward
|
---|
| 113 | * - EFORWARD is sent to the receiver, ipc_forward returns error code EFORWARD
|
---|
| 114 | *
|
---|
[ba81cab] | 115 | * Cleanup strategy
|
---|
[da1bafb] | 116 | *
|
---|
[9f22213] | 117 | * 1) Disconnect all our phones ('ipc_phone_hangup').
|
---|
[fbcfd458] | 118 | *
|
---|
| 119 | * 2) Disconnect all phones connected to answerbox.
|
---|
[ba81cab] | 120 | *
|
---|
[fbcfd458] | 121 | * 3) Answer all messages in 'calls' and 'dispatched_calls' queues with
|
---|
[9f22213] | 122 | * appropriate error code (EHANGUP, EFORWARD).
|
---|
[ba81cab] | 123 | *
|
---|
[7c7aae16] | 124 | * 4) Wait for all async answers to arrive and dispose of them.
|
---|
[da1bafb] | 125 | *
|
---|
[4e49572] | 126 | */
|
---|
| 127 |
|
---|
| 128 | #include <synch/spinlock.h>
|
---|
| 129 | #include <ipc/ipc.h>
|
---|
| 130 | #include <arch.h>
|
---|
| 131 | #include <proc/task.h>
|
---|
| 132 | #include <ipc/ipcrsc.h>
|
---|
| 133 | #include <debug.h>
|
---|
| 134 |
|
---|
[8b243f2] | 135 | /** Find call_t * in call table according to callid.
|
---|
[4e49572] | 136 | *
|
---|
[8b243f2] | 137 | * @todo Some speedup (hash table?)
|
---|
| 138 | *
|
---|
[da1bafb] | 139 | * @param callid Userspace hash of the call. Currently it is the call
|
---|
| 140 | * structure kernel address.
|
---|
| 141 | *
|
---|
| 142 | * @return NULL on not found, otherwise pointer to the call
|
---|
| 143 | * structure.
|
---|
[8b243f2] | 144 | *
|
---|
[4e49572] | 145 | */
|
---|
[96b02eb9] | 146 | call_t *get_call(sysarg_t callid)
|
---|
[4e49572] | 147 | {
|
---|
[da1bafb] | 148 | call_t *result = NULL;
|
---|
| 149 |
|
---|
| 150 | irq_spinlock_lock(&TASK->answerbox.lock, true);
|
---|
[55b77d9] | 151 |
|
---|
| 152 | list_foreach(TASK->answerbox.dispatched_calls, lst) {
|
---|
[da1bafb] | 153 | call_t *call = list_get_instance(lst, call_t, link);
|
---|
[96b02eb9] | 154 | if ((sysarg_t) call == callid) {
|
---|
[ca687ad] | 155 | result = call;
|
---|
| 156 | break;
|
---|
| 157 | }
|
---|
| 158 | }
|
---|
[da1bafb] | 159 |
|
---|
| 160 | irq_spinlock_unlock(&TASK->answerbox.lock, true);
|
---|
[ca687ad] | 161 | return result;
|
---|
[4e49572] | 162 | }
|
---|
| 163 |
|
---|
[2c0e5d2] | 164 | /** Allocate new phone slot in the specified task.
|
---|
| 165 | *
|
---|
[da1bafb] | 166 | * @param task Task for which to allocate a new phone.
|
---|
| 167 | *
|
---|
| 168 | * @return New phone handle or -1 if the phone handle limit is
|
---|
| 169 | * exceeded.
|
---|
[8b243f2] | 170 | *
|
---|
| 171 | */
|
---|
[da1bafb] | 172 | int phone_alloc(task_t *task)
|
---|
[4e49572] | 173 | {
|
---|
[da1bafb] | 174 | irq_spinlock_lock(&task->lock, true);
|
---|
| 175 |
|
---|
| 176 | size_t i;
|
---|
[8b243f2] | 177 | for (i = 0; i < IPC_MAX_PHONES; i++) {
|
---|
[da1bafb] | 178 | if ((task->phones[i].state == IPC_PHONE_HUNGUP) &&
|
---|
| 179 | (atomic_get(&task->phones[i].active_calls) == 0))
|
---|
| 180 | task->phones[i].state = IPC_PHONE_FREE;
|
---|
| 181 |
|
---|
| 182 | if (task->phones[i].state == IPC_PHONE_FREE) {
|
---|
| 183 | task->phones[i].state = IPC_PHONE_CONNECTING;
|
---|
[4e49572] | 184 | break;
|
---|
| 185 | }
|
---|
| 186 | }
|
---|
[da1bafb] | 187 |
|
---|
| 188 | irq_spinlock_unlock(&task->lock, true);
|
---|
| 189 |
|
---|
[645d9ed2] | 190 | if (i == IPC_MAX_PHONES)
|
---|
[4e49572] | 191 | return -1;
|
---|
[da1bafb] | 192 |
|
---|
[4e49572] | 193 | return i;
|
---|
| 194 | }
|
---|
| 195 |
|
---|
[8b243f2] | 196 | /** Mark a phone structure free.
|
---|
| 197 | *
|
---|
[da1bafb] | 198 | * @param phone Phone structure to be marked free.
|
---|
| 199 | *
|
---|
[8b243f2] | 200 | */
|
---|
[7c7aae16] | 201 | static void phone_deallocp(phone_t *phone)
|
---|
| 202 | {
|
---|
[eb3d379] | 203 | ASSERT(phone->state == IPC_PHONE_CONNECTING);
|
---|
[7c7aae16] | 204 |
|
---|
[da1bafb] | 205 | /* Atomic operation */
|
---|
[eb3d379] | 206 | phone->state = IPC_PHONE_FREE;
|
---|
[7c7aae16] | 207 | }
|
---|
| 208 |
|
---|
[8b243f2] | 209 | /** Free slot from a disconnected phone.
|
---|
| 210 | *
|
---|
| 211 | * All already sent messages will be correctly processed.
|
---|
[fbcfd458] | 212 | *
|
---|
[da1bafb] | 213 | * @param phoneid Phone handle of the phone to be freed.
|
---|
| 214 | *
|
---|
[fbcfd458] | 215 | */
|
---|
[4e49572] | 216 | void phone_dealloc(int phoneid)
|
---|
| 217 | {
|
---|
[7c7aae16] | 218 | phone_deallocp(&TASK->phones[phoneid]);
|
---|
[4e49572] | 219 | }
|
---|
| 220 |
|
---|
[8b243f2] | 221 | /** Connect phone to a given answerbox.
|
---|
[ba81cab] | 222 | *
|
---|
[da1bafb] | 223 | * @param phoneid Phone handle to be connected.
|
---|
| 224 | * @param box Answerbox to which to connect the phone handle.
|
---|
[ba81cab] | 225 | *
|
---|
| 226 | * The procedure _enforces_ that the user first marks the phone
|
---|
| 227 | * busy (e.g. via phone_alloc) and then connects the phone, otherwise
|
---|
| 228 | * race condition may appear.
|
---|
[da1bafb] | 229 | *
|
---|
[ba81cab] | 230 | */
|
---|
[4e49572] | 231 | void phone_connect(int phoneid, answerbox_t *box)
|
---|
| 232 | {
|
---|
| 233 | phone_t *phone = &TASK->phones[phoneid];
|
---|
| 234 |
|
---|
[eb3d379] | 235 | ASSERT(phone->state == IPC_PHONE_CONNECTING);
|
---|
[4e49572] | 236 | ipc_phone_connect(phone, box);
|
---|
| 237 | }
|
---|
[b45c443] | 238 |
|
---|
[cc73a8a1] | 239 | /** @}
|
---|
[b45c443] | 240 | */
|
---|