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 <kobject/kobject.h>
|
---|
36 | #include <proc/task.h>
|
---|
37 | #include <synch/spinlock.h>
|
---|
38 | #include <abi/errno.h>
|
---|
39 |
|
---|
40 | void kobject_initialize(kobject_t *kobj)
|
---|
41 | {
|
---|
42 | kobj->type = KOBJECT_TYPE_INVALID;
|
---|
43 | kobj->can_reclaim = NULL;
|
---|
44 | }
|
---|
45 |
|
---|
46 | kobject_t *kobject_get(task_t *task, int cap, kobject_type_t type)
|
---|
47 | {
|
---|
48 | if ((cap < 0) || (cap >= MAX_KERNEL_OBJECTS))
|
---|
49 | return NULL;
|
---|
50 | if (task->kobject[cap].type != type)
|
---|
51 | return NULL;
|
---|
52 | return &task->kobject[cap];
|
---|
53 | }
|
---|
54 |
|
---|
55 | kobject_t *kobject_get_current(int cap, kobject_type_t type)
|
---|
56 | {
|
---|
57 | return kobject_get(TASK, cap, type);
|
---|
58 | }
|
---|
59 |
|
---|
60 | int kobject_alloc(task_t *task)
|
---|
61 | {
|
---|
62 | int cap;
|
---|
63 |
|
---|
64 | irq_spinlock_lock(&task->lock, true);
|
---|
65 | for (cap = 0; cap < MAX_KERNEL_OBJECTS; cap++) {
|
---|
66 | kobject_t *kobj = &task->kobject[cap];
|
---|
67 | if (kobj->type > KOBJECT_TYPE_ALLOCATED) {
|
---|
68 | if (kobj->can_reclaim && kobj->can_reclaim(kobj))
|
---|
69 | kobject_initialize(kobj);
|
---|
70 | }
|
---|
71 | if (kobj->type == KOBJECT_TYPE_INVALID) {
|
---|
72 | kobj->type = KOBJECT_TYPE_ALLOCATED;
|
---|
73 | irq_spinlock_unlock(&task->lock, true);
|
---|
74 | return cap;
|
---|
75 | }
|
---|
76 | }
|
---|
77 | irq_spinlock_unlock(&task->lock, true);
|
---|
78 |
|
---|
79 | return ELIMIT;
|
---|
80 | }
|
---|
81 |
|
---|
82 | void kobject_free(task_t *task, int cap)
|
---|
83 | {
|
---|
84 | assert(cap >= 0);
|
---|
85 | assert(cap < MAX_KERNEL_OBJECTS);
|
---|
86 | assert(task->kobject[cap].type != KOBJECT_TYPE_INVALID);
|
---|
87 |
|
---|
88 | irq_spinlock_lock(&task->lock, true);
|
---|
89 | kobject_initialize(&task->kobject[cap]);
|
---|
90 | irq_spinlock_unlock(&task->lock, true);
|
---|
91 | }
|
---|
92 |
|
---|
93 | /** @}
|
---|
94 | */
|
---|