1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
|
// SPDX-License-Identifier: BSD-2-Clause
/*
* Copyright (c) 2017, EPAM Systems
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#include <optee_msg.h>
#include <stdio.h>
#include <types_ext.h>
#include <kernel/msg_param.h>
#include <mm/mobj.h>
/**
* msg_param_extract_pages() - extract list of pages from
* OPTEE_MSG_ATTR_NONCONTIG buffer.
*
* @buffer: pointer to parameters array
* @pages: output array of page addresses
* @num_pages: number of pages in array
*
* return:
* true on success, false otherwise
*
* @buffer points to the physical address of a structure that can be viewed as
*
* struct page_data {
* uint64_t pages_array[OPTEE_MSG_NONCONTIG_PAGE_SIZE/sizeof(uint64_t) - 1];
* uint64_t next_page_data;
* };
*
* So, it is a linked list of arrays, where each element of linked list fits
* exactly into one 4K page.
*
* This function extracts data from arrays into one array pointed by @pages
*
* @buffer points to data shared with normal world, so some precautions
* should be taken.
*/
static bool msg_param_extract_pages(paddr_t buffer, paddr_t *pages,
size_t num_pages)
{
size_t cnt;
struct mobj *mobj;
paddr_t page;
uint64_t *va;
bool ret = false;
if (buffer & SMALL_PAGE_MASK)
return false;
/*
* There we map first page of array.
* mobj_mapped_shm_alloc() will check if page resides in nonsec ddr
*/
mobj = mobj_mapped_shm_alloc(&buffer, 1, 0, 0);
if (!mobj)
return false;
va = mobj_get_va(mobj, 0);
assert(va);
for (cnt = 0; cnt < num_pages; cnt++, va++) {
/*
* If we about to roll over page boundary, then last entry holds
* address of next page of array. Unmap current page and map
* next one
*/
if (!((vaddr_t)(va + 1) & SMALL_PAGE_MASK)) {
page = *va;
if (page & SMALL_PAGE_MASK)
goto out;
mobj_free(mobj);
mobj = mobj_mapped_shm_alloc(&page, 1, 0, 0);
if (!mobj)
goto out;
va = mobj_get_va(mobj, 0);
assert(va);
}
pages[cnt] = *va;
if (pages[cnt] & SMALL_PAGE_MASK)
goto out;
}
ret = true;
out:
mobj_free(mobj);
return ret;
}
struct mobj *msg_param_mobj_from_noncontig(paddr_t buf_ptr, size_t size,
uint64_t shm_ref, bool map_buffer)
{
struct mobj *mobj = NULL;
paddr_t *pages;
paddr_t page_offset;
size_t num_pages;
page_offset = buf_ptr & SMALL_PAGE_MASK;
num_pages = (size + page_offset - 1) / SMALL_PAGE_SIZE + 1;
pages = malloc(num_pages * sizeof(paddr_t));
if (!pages)
return NULL;
if (!msg_param_extract_pages(buf_ptr & ~SMALL_PAGE_MASK,
pages, num_pages))
goto out;
if (map_buffer)
mobj = mobj_mapped_shm_alloc(pages, num_pages, page_offset,
shm_ref);
else
mobj = mobj_reg_shm_alloc(pages, num_pages, page_offset,
shm_ref);
out:
free(pages);
return mobj;
}
bool msg_param_init_memparam(struct optee_msg_param *param, struct mobj *mobj,
size_t offset, size_t size,
uint64_t cookie, enum msg_param_mem_dir dir)
{
if (mobj_matches(mobj, CORE_MEM_REG_SHM)) {
/* Registered SHM mobj */
switch (dir) {
case MSG_PARAM_MEM_DIR_IN:
param->attr = OPTEE_MSG_ATTR_TYPE_RMEM_INPUT;
break;
case MSG_PARAM_MEM_DIR_OUT:
param->attr = OPTEE_MSG_ATTR_TYPE_RMEM_OUTPUT;
break;
case MSG_PARAM_MEM_DIR_INOUT:
param->attr = OPTEE_MSG_ATTR_TYPE_RMEM_INOUT;
break;
default:
return false;
}
param->u.rmem.size = size;
param->u.rmem.offs = offset;
param->u.rmem.shm_ref = cookie;
} else if (mobj_matches(mobj, CORE_MEM_NSEC_SHM)) {
/* MOBJ from from predefined pool */
paddr_t pa;
if (mobj_get_pa(mobj, 0, 0, &pa) != TEE_SUCCESS)
return false;
switch (dir) {
case MSG_PARAM_MEM_DIR_IN:
param->attr = OPTEE_MSG_ATTR_TYPE_TMEM_INPUT;
break;
case MSG_PARAM_MEM_DIR_OUT:
param->attr = OPTEE_MSG_ATTR_TYPE_TMEM_OUTPUT;
break;
case MSG_PARAM_MEM_DIR_INOUT:
param->attr = OPTEE_MSG_ATTR_TYPE_TMEM_INOUT;
break;
default:
return false;
}
param->u.tmem.buf_ptr = pa + offset;
param->u.tmem.shm_ref = cookie;
param->u.tmem.size = size;
} else
return false;
return true;
}
|
