Subversion Repositories HelenOS-historic

Rev

Rev 15 | Go to most recent revision | Blame | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (C) 2001-2004 Jakub Jermar
  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. #include <proc/thread.h>
  30. #include <proc/task.h>
  31. #include <mm/vm.h>
  32. #include <mm/heap.h>
  33.  
  34. #include <synch/spinlock.h>
  35. #include <arch.h>
  36. #include <panic.h>
  37. #include <list.h>
  38.  
  39. spinlock_t tasks_lock;
  40. link_t tasks_head;
  41.  
  42. void task_init(void)
  43. {
  44.     TASK = NULL;
  45.     spinlock_initialize(&tasks_lock);
  46.     list_initialize(&tasks_head);
  47. }
  48.  
  49. task_t *task_create(vm_t *m)
  50. {
  51.     pri_t pri;
  52.     task_t *ta;
  53.    
  54.     ta = (task_t *) malloc(sizeof(task_t));
  55.     if (ta) {
  56.         spinlock_initialize(&ta->lock);
  57.         list_initialize(&ta->th_head);
  58.         list_initialize(&ta->tasks_link);
  59.         ta->vm = m;
  60.        
  61.         pri = cpu_priority_high();
  62.         spinlock_lock(&tasks_lock);
  63.         list_append(&ta->tasks_link, &tasks_head);
  64.         spinlock_unlock(&tasks_lock);
  65.         cpu_priority_restore(pri);
  66.     }
  67.     return ta;
  68. }
  69.  
  70.