forked from catid/libcat
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSecureErase.cpp
118 lines (106 loc) · 3.02 KB
/
SecureErase.cpp
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
/*
Copyright (c) 2013 Christopher A. Taylor. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* 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.
* Neither the name of LibCat nor the names of its contributors may be used
to endorse or promote products derived from this software without
specific prior written permission.
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 "SecureErase.hpp"
using namespace cat;
#ifdef CAT_HAS_VECTOR_EXTENSIONS
typedef u64 vec_block CAT_VECTOR_SIZE(u64, 4);
#endif
#ifdef __cplusplus
extern "C" {
#endif
void cat_secure_erase(volatile void *data, int len) {
// Calculate number of 64-bit words to erase, usually a multiple of 32 bytes
int words = len >> 3;
// Bulk erase blocks of 32 bytes at a time
volatile u64 *word;
#ifdef CAT_HAS_VECTOR_EXTENSIONS
#ifdef CAT_WORD_64
if (*(u64*)&data & 15) {
#else
if (*(u32*)&data & 15) {
#endif
#endif
word = (volatile u64 *)data;
while (words >= 4) {
word[0] = 0;
word[1] = 0;
word[2] = 0;
word[3] = 0;
words -= 4;
}
#ifdef CAT_HAS_VECTOR_EXTENSIONS
} else {
// Usual case:
volatile vec_block *block = (volatile vec_block *)data;
# ifdef CAT_VECTOR_EXT_CLANG
while (words >= 4) {
*block++ = 0;
# elif defined(CAT_VECTOR_EXT_GCC)
const vec_block zero = { 0 };
while (words >= 4) {
*block++ = zero;
# endif // Faster Clang version
words -= 4;
}
word = (volatile u64 *)block;
}
#endif // CAT_HAS_VECTOR_EXTENSIONS
// Erase any remaining words
while (words > 0) {
*word++ = 0;
--words;
}
// Erase odd numbers of words
volatile char *ch = (volatile char *)word;
switch (len & 7) {
case 7:
ch[6] = 0;
//fall-thru
case 6:
ch[5] = 0;
//fall-thru
case 5:
ch[4] = 0;
//fall-thru
case 4:
*(volatile u32 *)ch = 0;
break;
case 3:
ch[2] = 0;
//fall-thru
case 2:
ch[1] = 0;
//fall-thru
case 1:
ch[0] = 0;
//fall-thru
case 0:
default:
break;
}
}
#ifdef __cplusplus
}
#endif