| 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 | /* IPC resources management
|
|---|
| 36 | *
|
|---|
| 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.
|
|---|
| 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
|
|---|
| 45 | * - hangup phone (the caller has hung up)
|
|---|
| 46 | * - hangup phone (the answerbox is exiting)
|
|---|
| 47 | *
|
|---|
| 48 | * Locking strategy
|
|---|
| 49 | *
|
|---|
| 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)
|
|---|
| 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.
|
|---|
| 58 | * It is perfectly correct to pass unconnected phone to these functions and
|
|---|
| 59 | * proper reply will be generated.
|
|---|
| 60 | *
|
|---|
| 61 | * Locking order
|
|---|
| 62 | *
|
|---|
| 63 | * - first phone, then answerbox
|
|---|
| 64 | * + Easy locking on calls
|
|---|
| 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.
|
|---|
| 68 | *
|
|---|
| 69 | * Destroying is less frequent, this approach is taken.
|
|---|
| 70 | *
|
|---|
| 71 | * Phone call
|
|---|
| 72 | *
|
|---|
| 73 | * *** Connect_me_to ***
|
|---|
| 74 | * The caller sends IPC_M_CONNECT_ME_TO to an answerbox. The server receives
|
|---|
| 75 | * 'phoneid' of the connecting phone as an ARG5. If it answers with RETVAL=0,
|
|---|
| 76 | * the phonecall is accepted, otherwise it is refused.
|
|---|
| 77 | *
|
|---|
| 78 | * *** Connect_to_me ***
|
|---|
| 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.
|
|---|
| 85 | *
|
|---|
| 86 | * Phone hangup
|
|---|
| 87 | *
|
|---|
| 88 | * *** The caller hangs up (sys_ipc_hangup) ***
|
|---|
| 89 | * - The phone is disconnected (no more messages can be sent over this phone),
|
|---|
| 90 | * all in-progress messages are correctly handled. The answerbox receives
|
|---|
| 91 | * IPC_M_PHONE_HUNGUP call from the phone that hung up. When all async
|
|---|
| 92 | * calls are answered, the phone is deallocated.
|
|---|
| 93 | *
|
|---|
| 94 | * *** The answerbox hangs up (ipc_answer(EHANGUP))
|
|---|
| 95 | * - The phone is disconnected. EHANGUP response code is sent
|
|---|
| 96 | * to the calling task. All new calls through this phone
|
|---|
| 97 | * get a EHUNGUP error code, the task is expected to
|
|---|
| 98 | * send an sys_ipc_hangup after cleaning up its internal structures.
|
|---|
| 99 | *
|
|---|
| 100 | * Call forwarding
|
|---|
| 101 | *
|
|---|
| 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 | *
|
|---|
| 115 | * Cleanup strategy
|
|---|
| 116 | *
|
|---|
| 117 | * 1) Disconnect all our phones ('ipc_phone_hangup').
|
|---|
| 118 | *
|
|---|
| 119 | * 2) Disconnect all phones connected to answerbox.
|
|---|
| 120 | *
|
|---|
| 121 | * 3) Answer all messages in 'calls' and 'dispatched_calls' queues with
|
|---|
| 122 | * appropriate error code (EHANGUP, EFORWARD).
|
|---|
| 123 | *
|
|---|
| 124 | * 4) Wait for all async answers to arrive and dispose of them.
|
|---|
| 125 | *
|
|---|
| 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 <assert.h>
|
|---|
| 134 | #include <abi/errno.h>
|
|---|
| 135 | #include <cap/cap.h>
|
|---|
| 136 |
|
|---|
| 137 | /** Find call_t * in call table according to callid.
|
|---|
| 138 | *
|
|---|
| 139 | * @todo Some speedup (hash table?)
|
|---|
| 140 | *
|
|---|
| 141 | * @param callid Userspace hash of the call. Currently it is the call
|
|---|
| 142 | * structure kernel address.
|
|---|
| 143 | *
|
|---|
| 144 | * @return NULL on not found, otherwise pointer to the call
|
|---|
| 145 | * structure.
|
|---|
| 146 | *
|
|---|
| 147 | */
|
|---|
| 148 | call_t *get_call(sysarg_t callid)
|
|---|
| 149 | {
|
|---|
| 150 | call_t *result = NULL;
|
|---|
| 151 |
|
|---|
| 152 | irq_spinlock_lock(&TASK->answerbox.lock, true);
|
|---|
| 153 |
|
|---|
| 154 | list_foreach(TASK->answerbox.dispatched_calls, ab_link, call_t, call) {
|
|---|
| 155 | if ((sysarg_t) call == callid) {
|
|---|
| 156 | result = call;
|
|---|
| 157 | break;
|
|---|
| 158 | }
|
|---|
| 159 | }
|
|---|
| 160 |
|
|---|
| 161 | irq_spinlock_unlock(&TASK->answerbox.lock, true);
|
|---|
| 162 | return result;
|
|---|
| 163 | }
|
|---|
| 164 |
|
|---|
| 165 | /** Get phone from the current task by capability handle.
|
|---|
| 166 | *
|
|---|
| 167 | * @param handle Phone capability handle.
|
|---|
| 168 | * @param phone Place to store pointer to phone.
|
|---|
| 169 | *
|
|---|
| 170 | * @return Address of the phone kernel object.
|
|---|
| 171 | * @return NULL if the capability is invalid.
|
|---|
| 172 | *
|
|---|
| 173 | */
|
|---|
| 174 | phone_t *phone_get(task_t *task, int handle)
|
|---|
| 175 | {
|
|---|
| 176 | cap_t *cap = cap_get(task, handle, CAP_TYPE_PHONE);
|
|---|
| 177 | if (!cap)
|
|---|
| 178 | return NULL;
|
|---|
| 179 |
|
|---|
| 180 | return &cap->phone;
|
|---|
| 181 | }
|
|---|
| 182 |
|
|---|
| 183 | phone_t *phone_get_current(int handle)
|
|---|
| 184 | {
|
|---|
| 185 | return phone_get(TASK, handle);
|
|---|
| 186 | }
|
|---|
| 187 |
|
|---|
| 188 | static bool phone_can_reclaim(cap_t *cap)
|
|---|
| 189 | {
|
|---|
| 190 | assert(cap->type == CAP_TYPE_PHONE);
|
|---|
| 191 |
|
|---|
| 192 | return (cap->phone.state == IPC_PHONE_HUNGUP) &&
|
|---|
| 193 | (atomic_get(&cap->phone.active_calls) == 0);
|
|---|
| 194 | }
|
|---|
| 195 |
|
|---|
| 196 | /** Allocate new phone in the specified task.
|
|---|
| 197 | *
|
|---|
| 198 | * @param task Task for which to allocate a new phone.
|
|---|
| 199 | *
|
|---|
| 200 | * @return New phone capability handle.
|
|---|
| 201 | * @return Negative error code if a new capability cannot be allocated.
|
|---|
| 202 | */
|
|---|
| 203 | int phone_alloc(task_t *task)
|
|---|
| 204 | {
|
|---|
| 205 | int handle = cap_alloc(task);
|
|---|
| 206 | if (handle >= 0) {
|
|---|
| 207 | irq_spinlock_lock(&task->lock, true);
|
|---|
| 208 | cap_t *cap = cap_get(task, handle, CAP_TYPE_ALLOCATED);
|
|---|
| 209 | ipc_phone_init(&cap->phone, task);
|
|---|
| 210 | cap->type = CAP_TYPE_PHONE;
|
|---|
| 211 | cap->can_reclaim = phone_can_reclaim;
|
|---|
| 212 | cap->phone.state = IPC_PHONE_CONNECTING;
|
|---|
| 213 | irq_spinlock_unlock(&task->lock, true);
|
|---|
| 214 | }
|
|---|
| 215 |
|
|---|
| 216 | return handle;
|
|---|
| 217 | }
|
|---|
| 218 |
|
|---|
| 219 | /** Free slot from a disconnected phone.
|
|---|
| 220 | *
|
|---|
| 221 | * All already sent messages will be correctly processed.
|
|---|
| 222 | *
|
|---|
| 223 | * @param handle Phone capability handle of the phone to be freed.
|
|---|
| 224 | *
|
|---|
| 225 | */
|
|---|
| 226 | void phone_dealloc(int handle)
|
|---|
| 227 | {
|
|---|
| 228 | phone_t *phone = phone_get_current(handle);
|
|---|
| 229 |
|
|---|
| 230 | assert(phone);
|
|---|
| 231 | assert(phone->state == IPC_PHONE_CONNECTING);
|
|---|
| 232 |
|
|---|
| 233 | cap_free(TASK, handle);
|
|---|
| 234 | }
|
|---|
| 235 |
|
|---|
| 236 | /** Connect phone to a given answerbox.
|
|---|
| 237 | *
|
|---|
| 238 | * @param handle Capability handle of the phone to be connected.
|
|---|
| 239 | * @param box Answerbox to which to connect the phone.
|
|---|
| 240 | * @return True if the phone was connected, false otherwise.
|
|---|
| 241 | *
|
|---|
| 242 | * The procedure _enforces_ that the user first marks the phone busy (e.g. via
|
|---|
| 243 | * phone_alloc) and then connects the phone, otherwise race condition may
|
|---|
| 244 | * appear.
|
|---|
| 245 | *
|
|---|
| 246 | */
|
|---|
| 247 | bool phone_connect(int handle, answerbox_t *box)
|
|---|
| 248 | {
|
|---|
| 249 | phone_t *phone = phone_get_current(handle);
|
|---|
| 250 |
|
|---|
| 251 | assert(phone);
|
|---|
| 252 | assert(phone->state == IPC_PHONE_CONNECTING);
|
|---|
| 253 |
|
|---|
| 254 | return ipc_phone_connect(phone, box);
|
|---|
| 255 | }
|
|---|
| 256 |
|
|---|
| 257 | /** @}
|
|---|
| 258 | */
|
|---|