1 /**
2 * \file
3 * \brief Region map client stub implementation
4 */
5 /*
6 * (c) 2008-2009 Adam Lackorzynski <adam@os.inf.tu-dresden.de>,
7 * Alexander Warg <warg@os.inf.tu-dresden.de>
8 * economic rights: Technische Universität Dresden (Germany)
9 *
10 * This file is part of TUD:OS and distributed under the terms of the
11 * GNU General Public License 2.
12 * Please see the COPYING-GPL-2 file for details.
13 *
14 * As a special exception, you may use this file as part of a free software
15 * library without restriction. Specifically, if other files instantiate
16 * templates or use macros or inline functions from this file, or you compile
17 * this file and link it with other files to produce an executable, this
18 * file does not by itself cause the resulting executable to be covered by
19 * the GNU General Public License. This exception does not however
20 * invalidate any other reasons why the executable file might be covered by
21 * the GNU General Public License.
22 */
23 #include <l4/re/rm>
24 #include <l4/re/dataspace>
25
26 #include <l4/sys/cxx/ipc_client>
27
28 #include <l4/sys/task>
29 #include <l4/sys/err.h>
30
31 L4_RPC_DEF(L4Re::Rm::reserve_area);
32 L4_RPC_DEF(L4Re::Rm::free_area);
33 L4_RPC_DEF(L4Re::Rm::attach);
34 L4_RPC_DEF(L4Re::Rm::detach);
35 L4_RPC_DEF(L4Re::Rm::get_regions);
36 L4_RPC_DEF(L4Re::Rm::get_areas);
37 L4_RPC_DEF(L4Re::Rm::find);
38
39 namespace L4Re
40 {
41
42 long
attach(l4_addr_t * start,unsigned long size,Rm::Flags flags,L4::Ipc::Cap<Dataspace> mem,Rm::Offset offs,unsigned char align)43 Rm::attach(l4_addr_t *start, unsigned long size, Rm::Flags flags,
44 L4::Ipc::Cap<Dataspace> mem, Rm::Offset offs,
45 unsigned char align) const noexcept
46 {
47 if (((flags & F::Rights_mask) == Flags(0)) || (flags & F::Reserved))
48 mem = L4::Ipc::Cap<L4Re::Dataspace>();
49
50 long e = attach_t::call(c(), start, size, flags, mem, offs, align, mem.cap().cap());
51 if (e < 0)
52 return e;
53
54 if (flags & F::Eager_map)
55 e = mem.cap()->map_region(offs, map_flags(flags), *start, *start + size);
56
57 return e;
58 }
59
60 int
detach(l4_addr_t start,unsigned long size,L4::Cap<Dataspace> * mem,L4::Cap<L4::Task> task,unsigned flags)61 Rm::detach(l4_addr_t start, unsigned long size, L4::Cap<Dataspace> *mem,
62 L4::Cap<L4::Task> task, unsigned flags) const noexcept
63 {
64 l4_addr_t rstart = 0, rsize = 0;
65 l4_cap_idx_t mem_cap = L4_INVALID_CAP;
66 long e = detach_t::call(c(), start, size, flags, rstart, rsize, mem_cap);
67 if (L4_UNLIKELY(e < 0))
68 return e;
69
70 if (mem)
71 *mem = L4::Cap<L4Re::Dataspace>(mem_cap);
72
73 if (!task.is_valid())
74 return e;
75
76 rsize = l4_round_page(rsize);
77 unsigned order = L4_LOG2_PAGESIZE;
78 unsigned long sz = (1UL << order);
79 for (unsigned long p = rstart; rsize; p += sz, rsize -= sz)
80 {
81 while (sz > rsize)
82 {
83 --order;
84 sz >>= 1;
85 }
86
87 for (;;)
88 {
89 unsigned long m = sz << 1;
90 if (m > rsize)
91 break;
92
93 if (p & (m - 1))
94 break;
95
96 ++order;
97 sz <<= 1;
98 }
99
100 task->unmap(l4_fpage(p, order, L4_FPAGE_RWX),
101 L4_FP_ALL_SPACES);
102 }
103
104 return e;
105 }
106 }
107