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
195
196
197
198
199
200
201
202
203
204
205
206
|
/*
* Copyright (c) 2014, STMicroelectronics International N.V.
* 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 <kernel/tee_time.h>
#include <string.h>
#include <stdlib.h>
#include <kernel/tee_rpc.h>
#include <kernel/tee_core_trace.h>
#include <utee_defines.h>
#include <kernel/thread.h>
#include <sm/teesmc.h>
#include <mm/core_mmu.h>
/*
* tee_time_get_ree_time(): this function implements the GP Internal API
* function TEE_GetREETime()
* Goal is to get the time of the Rich Execution Environment
* This is why this time is provided through the supplicant
*/
TEE_Result tee_time_get_ree_time(TEE_Time *time)
{
TEE_Result res = TEE_ERROR_BAD_PARAMETERS;
struct teesmc32_arg *arg;
struct teesmc32_param *params;
paddr_t pharg = 0;
paddr_t phpayload = 0;
paddr_t cookie = 0;
TEE_Time *payload;
if (!time)
goto exit;
pharg = thread_rpc_alloc_arg(TEESMC32_GET_ARG_SIZE(1));
if (!pharg)
goto exit;
thread_st_rpc_alloc_payload(sizeof(TEE_Time), &phpayload, &cookie);
if (!phpayload)
goto exit;
if (!TEE_ALIGNMENT_IS_OK(pharg, struct teesmc32_arg) ||
!TEE_ALIGNMENT_IS_OK(phpayload, TEE_Time))
goto exit;
if (core_pa2va(pharg, (uint32_t *)&arg) ||
core_pa2va(phpayload, (uint32_t *)&payload))
goto exit;
arg->cmd = TEE_RPC_GET_TIME;
arg->ret = TEE_ERROR_GENERIC;
arg->num_params = 1;
params = TEESMC32_GET_PARAMS(arg);
params[0].attr = TEESMC_ATTR_TYPE_MEMREF_OUTPUT |
(TEESMC_ATTR_CACHE_I_WRITE_THR |
TEESMC_ATTR_CACHE_O_WRITE_THR) <<
TEESMC_ATTR_CACHE_SHIFT;
params[0].u.memref.buf_ptr = phpayload;
params[0].u.memref.size = sizeof(TEE_Time);
thread_rpc_cmd(pharg);
res = arg->ret;
if (res != TEE_SUCCESS)
goto exit;
*time = *payload;
exit:
thread_rpc_free_arg(pharg);
thread_st_rpc_free_payload(cookie);
return res;
}
struct tee_ta_time_offs {
TEE_UUID uuid;
TEE_Time offs;
bool positive;
};
static struct tee_ta_time_offs *tee_time_offs;
static size_t tee_time_num_offs;
static TEE_Result tee_time_ta_get_offs(const TEE_UUID *uuid,
const TEE_Time **offs, bool *positive)
{
size_t n;
for (n = 0; n < tee_time_num_offs; n++) {
if (memcmp(uuid, &tee_time_offs[n].uuid, sizeof(TEE_UUID))
== 0) {
*offs = &tee_time_offs[n].offs;
*positive = tee_time_offs[n].positive;
return TEE_SUCCESS;
}
}
return TEE_ERROR_TIME_NOT_SET;
}
static TEE_Result tee_time_ta_set_offs(const TEE_UUID *uuid,
const TEE_Time *offs, bool positive)
{
size_t n;
struct tee_ta_time_offs *o;
for (n = 0; n < tee_time_num_offs; n++) {
if (memcmp(uuid, &tee_time_offs[n].uuid, sizeof(TEE_UUID))
== 0) {
tee_time_offs[n].offs = *offs;
tee_time_offs[n].positive = positive;
return TEE_SUCCESS;
}
}
n = tee_time_num_offs + 1;
o = malloc(n * sizeof(struct tee_ta_time_offs));
if (o == NULL)
return TEE_ERROR_OUT_OF_MEMORY;
memcpy(o, tee_time_offs,
tee_time_num_offs * sizeof(struct tee_ta_time_offs));
free(tee_time_offs);
tee_time_offs = o;
tee_time_offs[tee_time_num_offs].uuid = *uuid;
tee_time_offs[tee_time_num_offs].offs = *offs;
tee_time_offs[tee_time_num_offs].positive = positive;
tee_time_num_offs = n;
return TEE_SUCCESS;
}
TEE_Result tee_time_get_ta_time(const TEE_UUID *uuid, TEE_Time *time)
{
TEE_Result res;
const TEE_Time *offs;
bool positive;
TEE_Time t;
TEE_Time t2;
res = tee_time_ta_get_offs(uuid, &offs, &positive);
if (res != TEE_SUCCESS)
return res;
res = tee_time_get_sys_time(&t);
if (res != TEE_SUCCESS)
return res;
if (positive) {
TEE_TIME_ADD(t, *offs, t2);
/* Detect wrapping, the wrapped time should be returned. */
if (TEE_TIME_LT(t2, t))
res = TEE_ERROR_OVERFLOW;
} else {
TEE_TIME_SUB(t, *offs, t2);
/* Detect wrapping, the wrapped time should be returned. */
if (TEE_TIME_LE(t, t2))
res = TEE_ERROR_OVERFLOW;
}
*time = t2;
return res;
}
TEE_Result tee_time_set_ta_time(const TEE_UUID *uuid, const TEE_Time *time)
{
TEE_Result res;
TEE_Time offs;
TEE_Time t;
/* Check that time is normalized. */
if (time->millis >= TEE_TIME_MILLIS_BASE)
return TEE_ERROR_BAD_PARAMETERS;
res = tee_time_get_sys_time(&t);
if (res != TEE_SUCCESS)
return res;
if (TEE_TIME_LT(t, *time)) {
TEE_TIME_SUB(*time, t, offs);
return tee_time_ta_set_offs(uuid, &offs, true);
} else {
TEE_TIME_SUB(t, *time, offs);
return tee_time_ta_set_offs(uuid, &offs, false);
}
}
|
