1 | /*
|
---|
2 | * Copyright (c) 2017 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 | /** @addtogroup generic
|
---|
30 | * @{
|
---|
31 | */
|
---|
32 | /** @file
|
---|
33 | */
|
---|
34 |
|
---|
35 | #include <cap/cap.h>
|
---|
36 | #include <proc/task.h>
|
---|
37 | #include <synch/spinlock.h>
|
---|
38 | #include <abi/errno.h>
|
---|
39 | #include <mm/slab.h>
|
---|
40 |
|
---|
41 | void cap_initialize(cap_t *cap)
|
---|
42 | {
|
---|
43 | cap->type = CAP_TYPE_INVALID;
|
---|
44 | cap->can_reclaim = NULL;
|
---|
45 | }
|
---|
46 |
|
---|
47 | void caps_task_alloc(task_t *task)
|
---|
48 | {
|
---|
49 | task->caps = malloc(sizeof(cap_t) * MAX_CAPS, 0);
|
---|
50 | }
|
---|
51 |
|
---|
52 | void caps_task_init(task_t *task)
|
---|
53 | {
|
---|
54 | for (int i = 0; i < MAX_CAPS; i++)
|
---|
55 | cap_initialize(&task->caps[i]);
|
---|
56 | }
|
---|
57 |
|
---|
58 | void caps_task_free(task_t *task)
|
---|
59 | {
|
---|
60 | free(task->caps);
|
---|
61 | }
|
---|
62 |
|
---|
63 | cap_t *cap_get(task_t *task, int handle, cap_type_t type)
|
---|
64 | {
|
---|
65 | if ((handle < 0) || (handle >= MAX_CAPS))
|
---|
66 | return NULL;
|
---|
67 | if (task->caps[handle].type != type)
|
---|
68 | return NULL;
|
---|
69 | return &task->caps[handle];
|
---|
70 | }
|
---|
71 |
|
---|
72 | cap_t *cap_get_current(int handle, cap_type_t type)
|
---|
73 | {
|
---|
74 | return cap_get(TASK, handle, type);
|
---|
75 | }
|
---|
76 |
|
---|
77 | int cap_alloc(task_t *task)
|
---|
78 | {
|
---|
79 | int handle;
|
---|
80 |
|
---|
81 | irq_spinlock_lock(&task->lock, true);
|
---|
82 | for (handle = 0; handle < MAX_CAPS; handle++) {
|
---|
83 | cap_t *cap = &task->caps[handle];
|
---|
84 | if (cap->type > CAP_TYPE_ALLOCATED) {
|
---|
85 | if (cap->can_reclaim && cap->can_reclaim(cap))
|
---|
86 | cap_initialize(cap);
|
---|
87 | }
|
---|
88 | if (cap->type == CAP_TYPE_INVALID) {
|
---|
89 | cap->type = CAP_TYPE_ALLOCATED;
|
---|
90 | irq_spinlock_unlock(&task->lock, true);
|
---|
91 | return handle;
|
---|
92 | }
|
---|
93 | }
|
---|
94 | irq_spinlock_unlock(&task->lock, true);
|
---|
95 |
|
---|
96 | return ELIMIT;
|
---|
97 | }
|
---|
98 |
|
---|
99 | void cap_free(task_t *task, int handle)
|
---|
100 | {
|
---|
101 | assert(handle >= 0);
|
---|
102 | assert(handle < MAX_CAPS);
|
---|
103 | assert(task->caps[handle].type != CAP_TYPE_INVALID);
|
---|
104 |
|
---|
105 | irq_spinlock_lock(&task->lock, true);
|
---|
106 | cap_initialize(&task->caps[handle]);
|
---|
107 | irq_spinlock_unlock(&task->lock, true);
|
---|
108 | }
|
---|
109 |
|
---|
110 | int cap_get_handle(task_t *task, cap_t *cap)
|
---|
111 | {
|
---|
112 | return cap - task->caps;
|
---|
113 | }
|
---|
114 |
|
---|
115 | /** @}
|
---|
116 | */
|
---|