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
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
|
/* $Id: asn1-safer-allocator.cpp $ */
/** @file
* IPRT - ASN.1, Safer Allocator, for sensitive data.
*/
/*
* Copyright (C) 2006-2023 Oracle and/or its affiliates.
*
* This file is part of VirtualBox base platform packages, as
* available from https://www.virtualbox.org.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation, in version 3 of the
* License.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, see <https://www.gnu.org/licenses>.
*
* The contents of this file may alternatively be used under the terms
* of the Common Development and Distribution License Version 1.0
* (CDDL), a copy of it is provided in the "COPYING.CDDL" file included
* in the VirtualBox distribution, in which case the provisions of the
* CDDL are applicable instead of those of the GPL.
*
* You may elect to license modified versions of this file under the
* terms and conditions of either the GPL or the CDDL or both.
*
* SPDX-License-Identifier: GPL-3.0-only OR CDDL-1.0
*/
/*********************************************************************************************************************************
* Header Files *
*********************************************************************************************************************************/
#include "internal/iprt.h"
#include <iprt/asn1.h>
#include <iprt/memsafer.h>
#include <iprt/errcore.h>
#include <iprt/string.h>
/**
* Aligns allocation sizes a little.
*
* @returns Aligned size.
* @param cb Requested size.
*/
static size_t rtAsn1SaferAllocator_AlignSize(size_t cb)
{
if (cb >= 64)
return RT_ALIGN_Z(cb, 64);
if (cb >= 32)
return RT_ALIGN_Z(cb, 32);
if (cb >= 16)
return RT_ALIGN_Z(cb, 16);
return cb;
}
/** @interface_method_impl{RTASN1ALLOCATORVTABLE,pfnFree} */
static DECLCALLBACK(void) rtAsn1SaferAllocator_Free(PCRTASN1ALLOCATORVTABLE pThis, PRTASN1ALLOCATION pAllocation, void *pv)
{
RT_NOREF_PV(pThis);
RTMemSaferFree(pv, pAllocation->cbAllocated);
pAllocation->cbAllocated = 0;
}
/** @interface_method_impl{RTASN1ALLOCATORVTABLE,pfnAlloc} */
static DECLCALLBACK(int) rtAsn1SaferAllocator_Alloc(PCRTASN1ALLOCATORVTABLE pThis, PRTASN1ALLOCATION pAllocation,
void **ppv, size_t cb)
{
size_t cbAlloc = rtAsn1SaferAllocator_AlignSize(cb);
void *pv = RTMemSaferAllocZ(cbAlloc);
if (pv)
{
*ppv = pv;
pAllocation->cbAllocated = (uint32_t)cbAlloc;
return VINF_SUCCESS;
}
RT_NOREF_PV(pThis);
return VERR_NO_MEMORY;
}
/** @interface_method_impl{RTASN1ALLOCATORVTABLE,pfnRealloc} */
static DECLCALLBACK(int) rtAsn1SaferAllocator_Realloc(PCRTASN1ALLOCATORVTABLE pThis, PRTASN1ALLOCATION pAllocation,
void *pvOld, void **ppvNew, size_t cbNew)
{
Assert(pvOld);
Assert(cbNew);
size_t cbAlloc = rtAsn1SaferAllocator_AlignSize(cbNew);
void *pv = RTMemSaferReallocZ(pAllocation->cbAllocated, pvOld, cbAlloc);
if (pv)
{
*ppvNew = pv;
pAllocation->cbAllocated = (uint32_t)cbAlloc;
return VINF_SUCCESS;
}
RT_NOREF_PV(pThis);
return VERR_NO_MEMORY;
}
/** @interface_method_impl{RTASN1ALLOCATORVTABLE,pfnFreeArray} */
static DECLCALLBACK(void) rtAsn1SaferAllocator_FreeArray(PCRTASN1ALLOCATORVTABLE pThis, PRTASN1ARRAYALLOCATION pAllocation,
void **papvArray)
{
RT_NOREF_PV(pThis);
Assert(papvArray);
Assert(pAllocation->cbEntry);
uint32_t i = pAllocation->cEntriesAllocated;
while (i-- > 0)
RTMemSaferFree(papvArray[i], pAllocation->cbEntry);
RTMemFree(papvArray);
pAllocation->cEntriesAllocated = 0;
pAllocation->cPointersAllocated = 0;
}
/** @interface_method_impl{RTASN1ALLOCATORVTABLE,pfnGrowArray} */
static DECLCALLBACK(int) rtAsn1SaferAllocator_GrowArray(PCRTASN1ALLOCATORVTABLE pThis, PRTASN1ARRAYALLOCATION pAllocation,
void ***ppapvArray, uint32_t cMinEntries)
{
RT_NOREF_PV(pThis);
/*
* Resize the pointer array. We do chunks of 64 bytes for now.
*/
void **papvArray = *ppapvArray;
uint32_t cPointers = RT_ALIGN_32(cMinEntries, 64 / sizeof(void *));
if (cPointers > pAllocation->cPointersAllocated)
{
void *pvPointers = RTMemRealloc(papvArray, cPointers * sizeof(void *));
if (pvPointers)
{ /* likely */ }
else if (cMinEntries > pAllocation->cPointersAllocated)
{
cPointers = cMinEntries;
pvPointers = RTMemRealloc(*ppapvArray, cPointers * sizeof(void *));
if (!pvPointers)
return VERR_NO_MEMORY;
}
else
{
cPointers = pAllocation->cPointersAllocated;
pvPointers = papvArray;
}
*ppapvArray = papvArray = (void **)pvPointers;
RT_BZERO(&papvArray[pAllocation->cPointersAllocated], (cPointers - pAllocation->cPointersAllocated) * sizeof(void *));
pAllocation->cPointersAllocated = cPointers;
}
/*
* Add more entries. Do multiple as the array grows.
*
* Note! We could possibly optimize this by allocating slabs of entries and
* slice them up. However, keep things as simple as possible for now.
*/
uint32_t cEntries = cMinEntries;
if (cEntries > 2)
{
if (cEntries > 8)
cEntries = RT_ALIGN_32(cEntries, 4);
else
cEntries = RT_ALIGN_32(cEntries, 2);
cEntries = RT_MIN(cEntries, cPointers);
Assert(cEntries >= cMinEntries);
}
Assert(cEntries <= pAllocation->cPointersAllocated);
while (pAllocation->cEntriesAllocated < cEntries)
{
void *pv;
papvArray[pAllocation->cEntriesAllocated] = pv = RTMemSaferAllocZ(pAllocation->cbEntry);
if (pv)
pAllocation->cEntriesAllocated++;
else if (pAllocation->cEntriesAllocated >= cMinEntries)
break;
else
return VERR_NO_MEMORY;
}
return VINF_SUCCESS;
}
/** @interface_method_impl{RTASN1ALLOCATORVTABLE,pfnShrinkArray} */
static DECLCALLBACK(void) rtAsn1SaferAllocator_ShrinkArray(PCRTASN1ALLOCATORVTABLE pThis, PRTASN1ARRAYALLOCATION pAllocation,
void ***ppapvArray, uint32_t cNew, uint32_t cCurrent)
{
RT_NOREF_PV(pThis);
/*
* For now we only zero the entries being removed.
*/
void **papvArray = *ppapvArray;
while (cNew < cCurrent)
{
RTMemWipeThoroughly(papvArray[cNew], pAllocation->cbEntry, 3);
RT_BZERO(papvArray[cNew], pAllocation->cbEntry);
cNew++;
}
}
/** The Safer ASN.1 allocator. */
#if 1 || !defined(IN_RING3) || defined(DOXYGEN_RUNNING)
RT_DECL_DATA_CONST(RTASN1ALLOCATORVTABLE const) g_RTAsn1SaferAllocator =
#else
RT_DECL_DATA_CONST(RTASN1ALLOCATORVTABLE const) g_RTAsn1SaferAllocatorDisabled =
#endif
{
rtAsn1SaferAllocator_Free,
rtAsn1SaferAllocator_Alloc,
rtAsn1SaferAllocator_Realloc,
rtAsn1SaferAllocator_FreeArray,
rtAsn1SaferAllocator_GrowArray,
rtAsn1SaferAllocator_ShrinkArray
};
|
