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
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
|
/********************************************************************************/
/* */
/* Hash */
/* Written by Ken Goldman */
/* IBM Thomas J. Watson Research Center */
/* */
/* (c) Copyright IBM Corporation 2015 - 2019 */
/* */
/* 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 names of the IBM Corporation 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 <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
#include <ibmtss/tss.h>
#include <ibmtss/tssutils.h>
#include <ibmtss/tssresponsecode.h>
#include <ibmtss/tssmarshal.h>
static void printUsage(void);
static void printHash(Hash_Out *out);
extern int tssUtilsVerbose;
int main(int argc, char *argv[])
{
TPM_RC rc = 0;
int i; /* argc iterator */
TSS_CONTEXT *tssContext = NULL;
Hash_In in;
Hash_Out out;
char hierarchyChar = 'n';
TPMI_RH_HIERARCHY hierarchy = TPM_RH_NULL;
TPMI_ALG_HASH halg = TPM_ALG_SHA256;
const char *inFilename = NULL;
const char *inString = NULL;
const char *hashFilename = NULL;
const char *ticketFilename = NULL;
int noSpace = FALSE;
size_t length = 0;
uint8_t *buffer = NULL; /* for the free */
setvbuf(stdout, 0, _IONBF, 0); /* output may be going through pipe to log file */
TSS_SetProperty(NULL, TPM_TRACE_LEVEL, "1");
tssUtilsVerbose = FALSE;
/* command line argument defaults */
for (i=1 ; (i<argc) && (rc == 0) ; i++) {
if (strcmp(argv[i],"-hi") == 0) {
i++;
if (i < argc) {
hierarchyChar = argv[i][0];
}
else {
printf("Missing parameter for -hi\n");
printUsage();
}
}
else if (strcmp(argv[i],"-halg") == 0) {
i++;
if (i < argc) {
if (strcmp(argv[i],"sha1") == 0) {
halg = TPM_ALG_SHA1;
}
else if (strcmp(argv[i],"sha256") == 0) {
halg = TPM_ALG_SHA256;
}
else if (strcmp(argv[i],"sha384") == 0) {
halg = TPM_ALG_SHA384;
}
else if (strcmp(argv[i],"sha512") == 0) {
halg = TPM_ALG_SHA512;
}
else {
printf("Bad parameter %s for -halg\n", argv[i]);
printUsage();
}
}
else {
printf("-halg option needs a value\n");
printUsage();
}
}
else if (strcmp(argv[i],"-ic") == 0) {
i++;
if (i < argc) {
inString = argv[i];
}
else {
printf("-ic option needs a value\n");
printUsage();
}
}
else if (strcmp(argv[i],"-if") == 0) {
i++;
if (i < argc) {
inFilename = argv[i];
}
else {
printf("-if option needs a value\n");
printUsage();
}
}
else if (strcmp(argv[i],"-oh") == 0) {
i++;
if (i < argc) {
hashFilename = argv[i];
}
else {
printf("-oh option needs a value\n");
printUsage();
}
}
else if (strcmp(argv[i],"-tk") == 0) {
i++;
if (i < argc) {
ticketFilename = argv[i];
}
else {
printf("-tk option needs a value\n");
printUsage();
}
}
else if (strcmp(argv[i],"-ns") == 0) {
noSpace = TRUE;
}
else if (strcmp(argv[i],"-h") == 0) {
printUsage();
}
else if (strcmp(argv[i],"-v") == 0) {
tssUtilsVerbose = TRUE;
TSS_SetProperty(NULL, TPM_TRACE_LEVEL, "2");
}
else {
printf("\n%s is not a valid option\n", argv[i]);
printUsage();
}
}
if ((inFilename == NULL) && (inString == NULL)) {
printf("Input file -if or input string -ic must be specified\n");
printUsage();
}
if ((inFilename != NULL) && (inString != NULL)) {
printf("Input file -if and input string -ic cannot both be specified\n");
printUsage();
}
/* Table 50 - TPMI_RH_HIERARCHY primaryHandle */
if (rc == 0) {
if (hierarchyChar == 'e') {
hierarchy = TPM_RH_ENDORSEMENT;
}
else if (hierarchyChar == 'o') {
hierarchy = TPM_RH_OWNER;
}
else if (hierarchyChar == 'p') {
hierarchy = TPM_RH_PLATFORM;
}
else if (hierarchyChar == 'n') {
hierarchy = TPM_RH_NULL;
}
else {
printf("Bad parameter %c for -hi\n", hierarchyChar);
printUsage();
}
in.hierarchy = hierarchy;
}
if (inFilename != NULL) {
if (rc == 0) {
rc = TSS_File_ReadBinaryFile(&buffer, /* freed @1 */
&length,
inFilename);
}
if (rc == 0) {
if (length > sizeof(in.data.t.buffer)) {
printf("Input data too long %lu\n", (unsigned long)length);
rc = TSS_RC_INSUFFICIENT_BUFFER;
}
}
if (rc == 0) {
/* data to be hashed */
in.data.t.size = (uint16_t)length; /* cast safe, range tested above */
memcpy(in.data.t.buffer, buffer, length);
}
}
if (inString != NULL) {
if (rc == 0) {
length = strlen(inString);
if (length > sizeof(in.data.t.buffer)) {
printf("Input data too long %lu\n", (unsigned long)length);
rc = TSS_RC_INSUFFICIENT_BUFFER;
}
}
if (rc == 0) {
/* data to be hashed */
in.data.t.size = (uint16_t)length; /* cast safe, range tested above */
memcpy(in.data.t.buffer, inString, length);
}
}
if (rc == 0) {
in.hashAlg = halg;
}
/* Start a TSS context */
if (rc == 0) {
rc = TSS_Create(&tssContext);
}
/* call TSS to execute the command */
if (rc == 0) {
rc = TSS_Execute(tssContext,
(RESPONSE_PARAMETERS *)&out,
(COMMAND_PARAMETERS *)&in,
NULL,
TPM_CC_Hash,
TPM_RH_NULL, NULL, 0);
}
{
TPM_RC rc1 = TSS_Delete(tssContext);
if (rc == 0) {
rc = rc1;
}
}
if ((rc == 0) && (hashFilename != NULL)) {
rc = TSS_File_WriteBinaryFile(out.outHash.t.buffer,
out.outHash.t.size,
hashFilename);
}
if ((rc == 0) && (ticketFilename != NULL)) {
rc = TSS_File_WriteStructure(&out.validation,
(MarshalFunction_t)TSS_TPMT_TK_HASHCHECK_Marshalu,
ticketFilename);
}
if (rc == 0) {
if (tssUtilsVerbose) printHash(&out);
if (noSpace) {
uint32_t bp;
for (bp = 0 ; bp < out.outHash.t.size ; bp++) {
printf("%02x", out.outHash.t.buffer[bp]);
}
printf("\n");
}
if (tssUtilsVerbose) printf("hash: success\n");
}
else {
const char *msg;
const char *submsg;
const char *num;
printf("hash: failed, rc %08x\n", rc);
TSS_ResponseCode_toString(&msg, &submsg, &num, rc);
printf("%s%s%s\n", msg, submsg, num);
rc = EXIT_FAILURE;
}
free(buffer); /* @1 */
return rc;
}
static void printHash(Hash_Out *out)
{
TSS_PrintAll("Hash", out->outHash.t.buffer, out->outHash.t.size);
}
static void printUsage(void)
{
printf("\n");
printf("hash\n");
printf("\n");
printf("Runs TPM2_Hash\n");
printf("\n");
printf("\t[-hi\thierarchy (e, o, p, n) (default null)]\n");
printf("\t\te endorsement, o owner, p platform, n null\n");
printf("\t[-halg\t(sha1, sha256, sha384, sha512) (default sha256)]\n");
printf("\t-if\tinput file to be hashed\n");
printf("\t-ic\tdata string to be hashed\n");
printf("\t[-ns\tno space, no text, no newlines]\n");
printf("\t[-oh\thash file name (default do not save)]\n");
printf("\t[-tk\tticket file name (default do not save)]\n");
exit(1);
}
|