[bc1f1c2] | 1 | /*
|
---|
| 2 | * Copyright (c) 2006 Ondrej Palkovsky
|
---|
| 3 | * Copyright (c) 2007 Jakub Jermar
|
---|
| 4 | * All rights reserved.
|
---|
| 5 | *
|
---|
| 6 | * Redistribution and use in source and binary forms, with or without
|
---|
| 7 | * modification, are permitted provided that the following conditions
|
---|
| 8 | * are met:
|
---|
| 9 | *
|
---|
| 10 | * - Redistributions of source code must retain the above copyright
|
---|
| 11 | * notice, this list of conditions and the following disclaimer.
|
---|
| 12 | * - Redistributions in binary form must reproduce the above copyright
|
---|
| 13 | * notice, this list of conditions and the following disclaimer in the
|
---|
| 14 | * documentation and/or other materials provided with the distribution.
|
---|
| 15 | * - The name of the author may not be used to endorse or promote products
|
---|
| 16 | * derived from this software without specific prior written permission.
|
---|
| 17 | *
|
---|
| 18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
---|
| 19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
---|
| 20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
| 21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
| 22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
| 23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
---|
| 24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
---|
| 25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
| 26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
---|
| 27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
| 28 | */
|
---|
| 29 |
|
---|
| 30 | /** @addtogroup libc
|
---|
| 31 | * @{
|
---|
| 32 | */
|
---|
| 33 | /** @file
|
---|
| 34 | */
|
---|
| 35 |
|
---|
[d9c8c81] | 36 | #include <adt/list.h>
|
---|
[bc1f1c2] | 37 | #include <fibril.h>
|
---|
[fa23560] | 38 | #include <thread.h>
|
---|
| 39 | #include <tls.h>
|
---|
[bc1f1c2] | 40 | #include <malloc.h>
|
---|
| 41 | #include <unistd.h>
|
---|
| 42 | #include <stdio.h>
|
---|
[36e9cd1] | 43 | #include <arch/barrier.h>
|
---|
[bc1f1c2] | 44 | #include <libarch/faddr.h>
|
---|
| 45 | #include <futex.h>
|
---|
| 46 | #include <assert.h>
|
---|
| 47 | #include <async.h>
|
---|
| 48 |
|
---|
| 49 | #ifndef FIBRIL_INITIAL_STACK_PAGES_NO
|
---|
[596d65c] | 50 | #define FIBRIL_INITIAL_STACK_PAGES_NO 1
|
---|
[bc1f1c2] | 51 | #endif
|
---|
| 52 |
|
---|
[cc27c8c5] | 53 | /**
|
---|
[596d65c] | 54 | * This futex serializes access to ready_list,
|
---|
| 55 | * serialized_list and manager_list.
|
---|
| 56 | */
|
---|
[12f91130] | 57 | static atomic_t fibril_futex = FUTEX_INITIALIZER;
|
---|
| 58 |
|
---|
[bc1f1c2] | 59 | static LIST_INITIALIZE(ready_list);
|
---|
| 60 | static LIST_INITIALIZE(serialized_list);
|
---|
| 61 | static LIST_INITIALIZE(manager_list);
|
---|
| 62 |
|
---|
[cc27c8c5] | 63 | /** Number of threads that are executing a manager fibril. */
|
---|
| 64 | static int threads_in_manager;
|
---|
[596d65c] | 65 |
|
---|
| 66 | /**
|
---|
| 67 | * Number of threads that are executing a manager fibril
|
---|
| 68 | * and are serialized. Protected by async_futex.
|
---|
| 69 | */
|
---|
| 70 | static int serialized_threads;
|
---|
| 71 |
|
---|
[26360f7] | 72 | /** Fibril-local count of serialization. If > 0, we must not preempt */
|
---|
| 73 | static fibril_local int serialization_count;
|
---|
[bc1f1c2] | 74 |
|
---|
[596d65c] | 75 | /** Function that spans the whole life-cycle of a fibril.
|
---|
| 76 | *
|
---|
| 77 | * Each fibril begins execution in this function. Then the function implementing
|
---|
| 78 | * the fibril logic is called. After its return, the return value is saved.
|
---|
| 79 | * The fibril then switches to another fibril, which cleans up after it.
|
---|
| 80 | *
|
---|
| 81 | */
|
---|
| 82 | static void fibril_main(void)
|
---|
[bc1f1c2] | 83 | {
|
---|
[596d65c] | 84 | fibril_t *fibril = __tcb_get()->fibril_data;
|
---|
| 85 |
|
---|
| 86 | /* Call the implementing function. */
|
---|
| 87 | fibril->retval = fibril->func(fibril->arg);
|
---|
| 88 |
|
---|
| 89 | fibril_switch(FIBRIL_FROM_DEAD);
|
---|
| 90 | /* Not reached */
|
---|
| 91 | }
|
---|
[bc1f1c2] | 92 |
|
---|
[596d65c] | 93 | /** Setup fibril information into TCB structure
|
---|
| 94 | *
|
---|
| 95 | */
|
---|
| 96 | fibril_t *fibril_setup(void)
|
---|
| 97 | {
|
---|
| 98 | tcb_t *tcb = __make_tls();
|
---|
[bc1f1c2] | 99 | if (!tcb)
|
---|
| 100 | return NULL;
|
---|
[596d65c] | 101 |
|
---|
| 102 | fibril_t *fibril = malloc(sizeof(fibril_t));
|
---|
| 103 | if (!fibril) {
|
---|
[bc1f1c2] | 104 | __free_tls(tcb);
|
---|
| 105 | return NULL;
|
---|
| 106 | }
|
---|
[596d65c] | 107 |
|
---|
| 108 | tcb->fibril_data = fibril;
|
---|
| 109 | fibril->tcb = tcb;
|
---|
| 110 |
|
---|
| 111 | fibril->func = NULL;
|
---|
| 112 | fibril->arg = NULL;
|
---|
| 113 | fibril->stack = NULL;
|
---|
| 114 | fibril->clean_after_me = NULL;
|
---|
| 115 | fibril->retval = 0;
|
---|
| 116 | fibril->flags = 0;
|
---|
| 117 |
|
---|
| 118 | return fibril;
|
---|
[bc1f1c2] | 119 | }
|
---|
| 120 |
|
---|
[596d65c] | 121 | void fibril_teardown(fibril_t *fibril)
|
---|
[bc1f1c2] | 122 | {
|
---|
[596d65c] | 123 | __free_tls(fibril->tcb);
|
---|
| 124 | free(fibril);
|
---|
[bc1f1c2] | 125 | }
|
---|
| 126 |
|
---|
[116d3f6f] | 127 | /** Switch from the current fibril.
|
---|
[bc1f1c2] | 128 | *
|
---|
| 129 | * If calling with FIBRIL_TO_MANAGER parameter, the async_futex should be
|
---|
| 130 | * held.
|
---|
| 131 | *
|
---|
[596d65c] | 132 | * @param stype Switch type. One of FIBRIL_PREEMPT, FIBRIL_TO_MANAGER,
|
---|
| 133 | * FIBRIL_FROM_MANAGER, FIBRIL_FROM_DEAD. The parameter
|
---|
| 134 | * describes the circumstances of the switch.
|
---|
| 135 | *
|
---|
| 136 | * @return 0 if there is no ready fibril,
|
---|
| 137 | * @return 1 otherwise.
|
---|
| 138 | *
|
---|
[bc1f1c2] | 139 | */
|
---|
[116d3f6f] | 140 | int fibril_switch(fibril_switch_type_t stype)
|
---|
[bc1f1c2] | 141 | {
|
---|
| 142 | int retval = 0;
|
---|
| 143 |
|
---|
| 144 | futex_down(&fibril_futex);
|
---|
[36e9cd1] | 145 |
|
---|
[bc1f1c2] | 146 | if (stype == FIBRIL_PREEMPT && list_empty(&ready_list))
|
---|
| 147 | goto ret_0;
|
---|
[36e9cd1] | 148 |
|
---|
[bc1f1c2] | 149 | if (stype == FIBRIL_FROM_MANAGER) {
|
---|
[36e9cd1] | 150 | if ((list_empty(&ready_list)) && (list_empty(&serialized_list)))
|
---|
[bc1f1c2] | 151 | goto ret_0;
|
---|
[36e9cd1] | 152 |
|
---|
[bc1f1c2] | 153 | /*
|
---|
[cc27c8c5] | 154 | * Do not preempt if there is not enough threads to run the
|
---|
[bd8bfcbd] | 155 | * ready fibrils which are not serialized.
|
---|
[bc1f1c2] | 156 | */
|
---|
[36e9cd1] | 157 | if ((list_empty(&serialized_list)) &&
|
---|
| 158 | (threads_in_manager <= serialized_threads)) {
|
---|
[bc1f1c2] | 159 | goto ret_0;
|
---|
| 160 | }
|
---|
| 161 | }
|
---|
[36e9cd1] | 162 |
|
---|
[bc1f1c2] | 163 | /* If we are going to manager and none exists, create it */
|
---|
[36e9cd1] | 164 | if ((stype == FIBRIL_TO_MANAGER) || (stype == FIBRIL_FROM_DEAD)) {
|
---|
[bc1f1c2] | 165 | while (list_empty(&manager_list)) {
|
---|
| 166 | futex_up(&fibril_futex);
|
---|
| 167 | async_create_manager();
|
---|
| 168 | futex_down(&fibril_futex);
|
---|
| 169 | }
|
---|
| 170 | }
|
---|
| 171 |
|
---|
[36e9cd1] | 172 | fibril_t *srcf = __tcb_get()->fibril_data;
|
---|
[bc1f1c2] | 173 | if (stype != FIBRIL_FROM_DEAD) {
|
---|
[36e9cd1] | 174 |
|
---|
[bc1f1c2] | 175 | /* Save current state */
|
---|
| 176 | if (!context_save(&srcf->ctx)) {
|
---|
| 177 | if (serialization_count)
|
---|
| 178 | srcf->flags &= ~FIBRIL_SERIALIZED;
|
---|
[36e9cd1] | 179 |
|
---|
[bc1f1c2] | 180 | if (srcf->clean_after_me) {
|
---|
| 181 | /*
|
---|
| 182 | * Cleanup after the dead fibril from which we
|
---|
| 183 | * restored context here.
|
---|
| 184 | */
|
---|
[36e9cd1] | 185 | void *stack = srcf->clean_after_me->stack;
|
---|
[116d3f6f] | 186 | if (stack) {
|
---|
| 187 | /*
|
---|
| 188 | * This check is necessary because a
|
---|
| 189 | * thread could have exited like a
|
---|
| 190 | * normal fibril using the
|
---|
| 191 | * FIBRIL_FROM_DEAD switch type. In that
|
---|
| 192 | * case, its fibril will not have the
|
---|
| 193 | * stack member filled.
|
---|
| 194 | */
|
---|
| 195 | free(stack);
|
---|
| 196 | }
|
---|
[bc1f1c2] | 197 | fibril_teardown(srcf->clean_after_me);
|
---|
| 198 | srcf->clean_after_me = NULL;
|
---|
| 199 | }
|
---|
[36e9cd1] | 200 |
|
---|
[bc1f1c2] | 201 | return 1; /* futex_up already done here */
|
---|
| 202 | }
|
---|
[36e9cd1] | 203 |
|
---|
[bc1f1c2] | 204 | /* Save myself to the correct run list */
|
---|
| 205 | if (stype == FIBRIL_PREEMPT)
|
---|
| 206 | list_append(&srcf->link, &ready_list);
|
---|
| 207 | else if (stype == FIBRIL_FROM_MANAGER) {
|
---|
| 208 | list_append(&srcf->link, &manager_list);
|
---|
[cc27c8c5] | 209 | threads_in_manager--;
|
---|
[36e9cd1] | 210 | } else {
|
---|
[bc1f1c2] | 211 | /*
|
---|
| 212 | * If stype == FIBRIL_TO_MANAGER, don't put ourselves to
|
---|
| 213 | * any list, we should already be somewhere, or we will
|
---|
| 214 | * be lost.
|
---|
| 215 | */
|
---|
| 216 | }
|
---|
| 217 | }
|
---|
[116d3f6f] | 218 |
|
---|
[bc1f1c2] | 219 | /* Choose a new fibril to run */
|
---|
[36e9cd1] | 220 | fibril_t *dstf;
|
---|
| 221 | if ((stype == FIBRIL_TO_MANAGER) || (stype == FIBRIL_FROM_DEAD)) {
|
---|
[bc1f1c2] | 222 | dstf = list_get_instance(manager_list.next, fibril_t, link);
|
---|
| 223 | if (serialization_count && stype == FIBRIL_TO_MANAGER) {
|
---|
[cc27c8c5] | 224 | serialized_threads++;
|
---|
[bc1f1c2] | 225 | srcf->flags |= FIBRIL_SERIALIZED;
|
---|
| 226 | }
|
---|
[cc27c8c5] | 227 | threads_in_manager++;
|
---|
[36e9cd1] | 228 |
|
---|
[116d3f6f] | 229 | if (stype == FIBRIL_FROM_DEAD)
|
---|
[bc1f1c2] | 230 | dstf->clean_after_me = srcf;
|
---|
| 231 | } else {
|
---|
| 232 | if (!list_empty(&serialized_list)) {
|
---|
| 233 | dstf = list_get_instance(serialized_list.next, fibril_t,
|
---|
| 234 | link);
|
---|
[cc27c8c5] | 235 | serialized_threads--;
|
---|
[bc1f1c2] | 236 | } else {
|
---|
| 237 | dstf = list_get_instance(ready_list.next, fibril_t,
|
---|
| 238 | link);
|
---|
| 239 | }
|
---|
| 240 | }
|
---|
| 241 | list_remove(&dstf->link);
|
---|
[36e9cd1] | 242 |
|
---|
[bc1f1c2] | 243 | futex_up(&fibril_futex);
|
---|
| 244 | context_restore(&dstf->ctx);
|
---|
| 245 | /* not reached */
|
---|
[36e9cd1] | 246 |
|
---|
[bc1f1c2] | 247 | ret_0:
|
---|
| 248 | futex_up(&fibril_futex);
|
---|
| 249 | return retval;
|
---|
| 250 | }
|
---|
| 251 |
|
---|
| 252 | /** Create a new fibril.
|
---|
| 253 | *
|
---|
[596d65c] | 254 | * @param func Implementing function of the new fibril.
|
---|
| 255 | * @param arg Argument to pass to func.
|
---|
| 256 | *
|
---|
| 257 | * @return 0 on failure or TLS of the new fibril.
|
---|
[bc1f1c2] | 258 | *
|
---|
| 259 | */
|
---|
| 260 | fid_t fibril_create(int (*func)(void *), void *arg)
|
---|
| 261 | {
|
---|
[596d65c] | 262 | fibril_t *fibril;
|
---|
| 263 |
|
---|
| 264 | fibril = fibril_setup();
|
---|
| 265 | if (fibril == NULL)
|
---|
[bc1f1c2] | 266 | return 0;
|
---|
[596d65c] | 267 |
|
---|
| 268 | fibril->stack =
|
---|
| 269 | (char *) malloc(FIBRIL_INITIAL_STACK_PAGES_NO * getpagesize());
|
---|
| 270 | if (!fibril->stack) {
|
---|
| 271 | fibril_teardown(fibril);
|
---|
[bc1f1c2] | 272 | return 0;
|
---|
| 273 | }
|
---|
[116d3f6f] | 274 |
|
---|
[596d65c] | 275 | fibril->func = func;
|
---|
| 276 | fibril->arg = arg;
|
---|
| 277 |
|
---|
| 278 | context_save(&fibril->ctx);
|
---|
| 279 | context_set(&fibril->ctx, FADDR(fibril_main), fibril->stack,
|
---|
| 280 | FIBRIL_INITIAL_STACK_PAGES_NO * getpagesize(), fibril->tcb);
|
---|
[bc1f1c2] | 281 |
|
---|
[596d65c] | 282 | return (fid_t) fibril;
|
---|
[bc1f1c2] | 283 | }
|
---|
| 284 |
|
---|
| 285 | /** Add a fibril to the ready list.
|
---|
| 286 | *
|
---|
[596d65c] | 287 | * @param fid Pointer to the fibril structure of the fibril to be
|
---|
| 288 | * added.
|
---|
| 289 | *
|
---|
[bc1f1c2] | 290 | */
|
---|
| 291 | void fibril_add_ready(fid_t fid)
|
---|
| 292 | {
|
---|
[596d65c] | 293 | fibril_t *fibril = (fibril_t *) fid;
|
---|
| 294 |
|
---|
[bc1f1c2] | 295 | futex_down(&fibril_futex);
|
---|
[596d65c] | 296 |
|
---|
| 297 | if ((fibril->flags & FIBRIL_SERIALIZED))
|
---|
| 298 | list_append(&fibril->link, &serialized_list);
|
---|
[bc1f1c2] | 299 | else
|
---|
[596d65c] | 300 | list_append(&fibril->link, &ready_list);
|
---|
| 301 |
|
---|
[bc1f1c2] | 302 | futex_up(&fibril_futex);
|
---|
| 303 | }
|
---|
| 304 |
|
---|
| 305 | /** Add a fibril to the manager list.
|
---|
| 306 | *
|
---|
[596d65c] | 307 | * @param fid Pointer to the fibril structure of the fibril to be
|
---|
| 308 | * added.
|
---|
| 309 | *
|
---|
[bc1f1c2] | 310 | */
|
---|
| 311 | void fibril_add_manager(fid_t fid)
|
---|
| 312 | {
|
---|
[596d65c] | 313 | fibril_t *fibril = (fibril_t *) fid;
|
---|
| 314 |
|
---|
[bc1f1c2] | 315 | futex_down(&fibril_futex);
|
---|
[596d65c] | 316 | list_append(&fibril->link, &manager_list);
|
---|
[bc1f1c2] | 317 | futex_up(&fibril_futex);
|
---|
| 318 | }
|
---|
| 319 |
|
---|
| 320 | /** Remove one manager from the manager list. */
|
---|
| 321 | void fibril_remove_manager(void)
|
---|
| 322 | {
|
---|
| 323 | futex_down(&fibril_futex);
|
---|
[596d65c] | 324 |
|
---|
| 325 | if (!list_empty(&manager_list))
|
---|
| 326 | list_remove(manager_list.next);
|
---|
| 327 |
|
---|
[bc1f1c2] | 328 | futex_up(&fibril_futex);
|
---|
| 329 | }
|
---|
| 330 |
|
---|
| 331 | /** Return fibril id of the currently running fibril.
|
---|
| 332 | *
|
---|
[3562ec82] | 333 | * @return fibril ID of the currently running fibril.
|
---|
| 334 | *
|
---|
[bc1f1c2] | 335 | */
|
---|
| 336 | fid_t fibril_get_id(void)
|
---|
| 337 | {
|
---|
| 338 | return (fid_t) __tcb_get()->fibril_data;
|
---|
| 339 | }
|
---|
| 340 |
|
---|
[3562ec82] | 341 | /** Disable preemption
|
---|
[bc1f1c2] | 342 | *
|
---|
| 343 | * If the fibril wants to send several message in a row and does not want to be
|
---|
| 344 | * preempted, it should start async_serialize_start() in the beginning of
|
---|
| 345 | * communication and async_serialize_end() in the end. If it is a true
|
---|
| 346 | * multithreaded application, it should protect the communication channel by a
|
---|
[3562ec82] | 347 | * futex as well.
|
---|
| 348 | *
|
---|
[bc1f1c2] | 349 | */
|
---|
| 350 | void fibril_inc_sercount(void)
|
---|
| 351 | {
|
---|
| 352 | serialization_count++;
|
---|
| 353 | }
|
---|
| 354 |
|
---|
| 355 | /** Restore the preemption counter to the previous state. */
|
---|
| 356 | void fibril_dec_sercount(void)
|
---|
| 357 | {
|
---|
| 358 | serialization_count--;
|
---|
| 359 | }
|
---|
| 360 |
|
---|
| 361 | /** @}
|
---|
| 362 | */
|
---|