source: mainline/kernel/generic/src/cap/cap.c@ 48bcf49

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 48bcf49 was 48bcf49, checked in by Jakub Jermar <jakub@…>, 8 years ago

Introduce reference-counted kobjects

Capabilities are thus reduced to task-local names for references to kobjects.

  • Property mode set to 100644
File size: 5.7 KB
Line 
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/mutex.h>
38#include <abi/errno.h>
39#include <mm/slab.h>
40#include <adt/list.h>
41
42static kobject_t *cap_unpublish_locked(task_t *, cap_handle_t, kobject_type_t);
43
44void cap_initialize(cap_t *cap, cap_handle_t handle)
45{
46 cap->state = CAP_STATE_FREE;
47 cap->handle = handle;
48 link_initialize(&cap->link);
49}
50
51void caps_task_alloc(task_t *task)
52{
53 task->cap_info = (cap_info_t *) malloc(sizeof(cap_info_t), 0);
54 task->cap_info->caps = malloc(sizeof(cap_t) * MAX_CAPS, 0);
55}
56
57void caps_task_init(task_t *task)
58{
59 mutex_initialize(&task->cap_info->lock, MUTEX_PASSIVE);
60
61 for (kobject_type_t t = 0; t < KOBJECT_TYPE_MAX; t++)
62 list_initialize(&task->cap_info->type_list[t]);
63
64 for (cap_handle_t h = 0; h < MAX_CAPS; h++)
65 cap_initialize(&task->cap_info->caps[h], h);
66}
67
68void caps_task_free(task_t *task)
69{
70 free(task->cap_info->caps);
71 free(task->cap_info);
72}
73
74bool caps_apply_to_kobject_type(task_t *task, kobject_type_t type,
75 bool (*cb)(cap_t *, void *), void *arg)
76{
77 bool done = true;
78
79 mutex_lock(&task->cap_info->lock);
80 list_foreach_safe(task->cap_info->type_list[type], cur, next) {
81 cap_t *cap = list_get_instance(cur, cap_t, link);
82 done = cb(cap, arg);
83 if (!done)
84 break;
85 }
86 mutex_unlock(&task->cap_info->lock);
87
88 return done;
89}
90
91static cap_t *cap_get(task_t *task, cap_handle_t handle, cap_state_t state)
92{
93 assert(mutex_locked(&task->cap_info->lock));
94
95 if ((handle < 0) || (handle >= MAX_CAPS))
96 return NULL;
97 if (task->cap_info->caps[handle].state != state)
98 return NULL;
99 return &task->cap_info->caps[handle];
100}
101
102cap_handle_t cap_alloc(task_t *task)
103{
104 mutex_lock(&task->cap_info->lock);
105 for (cap_handle_t handle = 0; handle < MAX_CAPS; handle++) {
106 cap_t *cap = &task->cap_info->caps[handle];
107 /* See if the capability should be garbage-collected */
108 if (cap->state == CAP_STATE_PUBLISHED &&
109 cap->kobject->ops->reclaim &&
110 cap->kobject->ops->reclaim(cap->kobject)) {
111 kobject_t *kobj = cap_unpublish_locked(task, handle,
112 cap->kobject->type);
113 kobject_put(kobj);
114 cap_initialize(&task->cap_info->caps[handle], handle);
115 }
116 if (cap->state == CAP_STATE_FREE) {
117 cap->state = CAP_STATE_ALLOCATED;
118 mutex_unlock(&task->cap_info->lock);
119 return handle;
120 }
121 }
122 mutex_unlock(&task->cap_info->lock);
123
124 return ELIMIT;
125}
126
127void
128cap_publish(task_t *task, cap_handle_t handle, kobject_t *kobj)
129{
130 mutex_lock(&task->cap_info->lock);
131 cap_t *cap = cap_get(task, handle, CAP_STATE_ALLOCATED);
132 assert(cap);
133 cap->state = CAP_STATE_PUBLISHED;
134 /* Hand over kobj's reference to cap */
135 cap->kobject = kobj;
136 list_append(&cap->link, &task->cap_info->type_list[kobj->type]);
137 mutex_unlock(&task->cap_info->lock);
138}
139
140static kobject_t *
141cap_unpublish_locked(task_t *task, cap_handle_t handle, kobject_type_t type)
142{
143 kobject_t *kobj = NULL;
144
145 cap_t *cap = cap_get(task, handle, CAP_STATE_PUBLISHED);
146 if (cap) {
147 if (cap->kobject->type == type) {
148 /* Hand over cap's reference to kobj */
149 kobj = cap->kobject;
150 cap->kobject = NULL;
151 list_remove(&cap->link);
152 cap->state = CAP_STATE_ALLOCATED;
153 }
154 }
155
156 return kobj;
157}
158kobject_t *cap_unpublish(task_t *task, cap_handle_t handle, kobject_type_t type)
159{
160
161 mutex_lock(&task->cap_info->lock);
162 kobject_t *kobj = cap_unpublish_locked(task, handle, type);
163 mutex_unlock(&task->cap_info->lock);
164
165 return kobj;
166}
167
168void cap_free(task_t *task, cap_handle_t handle)
169{
170 assert(handle >= 0);
171 assert(handle < MAX_CAPS);
172 assert(task->cap_info->caps[handle].state == CAP_STATE_ALLOCATED);
173
174 mutex_lock(&task->cap_info->lock);
175 cap_initialize(&task->cap_info->caps[handle], handle);
176 mutex_unlock(&task->cap_info->lock);
177}
178
179void kobject_initialize(kobject_t *kobj, kobject_type_t type, void *raw,
180 kobject_ops_t *ops)
181{
182 atomic_set(&kobj->refcnt, 1);
183 kobj->type = type;
184 kobj->raw = raw;
185 kobj->ops = ops;
186}
187
188kobject_t *
189kobject_get(struct task *task, cap_handle_t handle, kobject_type_t type)
190{
191 kobject_t *kobj = NULL;
192
193 mutex_lock(&task->cap_info->lock);
194 cap_t *cap = cap_get(task, handle, CAP_STATE_PUBLISHED);
195 if (cap) {
196 if (cap->kobject->type == type) {
197 kobj = cap->kobject;
198 atomic_inc(&kobj->refcnt);
199 }
200 }
201 mutex_unlock(&task->cap_info->lock);
202
203 return kobj;
204}
205
206void kobject_put(kobject_t *kobj)
207{
208 if (atomic_postdec(&kobj->refcnt) == 1) {
209 kobj->ops->destroy(kobj->raw);
210 free(kobj);
211 }
212}
213
214/** @}
215 */
Note: See TracBrowser for help on using the repository browser.